Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listAug 3, 2026 21:46TonyTonyScore: 16,052Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:4616,046142,987,812111,878,00021,307,0002,113,536
2Aug 3, 2026 21:4616,046142,981,833111,887,00021,299,0002,113,536
3Aug 3, 2026 21:4616,047142,930,639111,896,00021,296,0002,113,536
4Aug 3, 2026 21:4616,049143,029,730111,892,00021,322,0002,113,536
5Aug 3, 2026 21:4616,052143,115,997111,936,00021,302,0002,113,536
6Aug 3, 2026 21:4616,065143,197,366111,943,00021,400,0002,113,536
7Aug 3, 2026 21:4616,081143,362,958111,969,00021,506,0002,113,536
8Aug 3, 2026 21:4616,098143,447,833111,976,00021,641,0002,113,536
9Aug 3, 2026 21:4616,119143,624,206111,955,00021,838,0002,113,536