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 listSep 5, 2026 09:36Kevin HeaveyKevin HeaveyScore: 3,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 09:383,58539,927,52328,702,0001,054,0002,121,728
2Sep 5, 2026 09:383,59540,119,54628,821,0001,022,0002,117,632
3Sep 5, 2026 09:383,60540,081,72028,876,0001,051,0002,117,632
4Sep 5, 2026 09:383,68642,311,93529,548,0001,049,0002,117,632
5Sep 5, 2026 09:383,69840,959,59229,653,0001,046,0002,117,632
6Sep 5, 2026 09:383,86442,260,59931,028,0001,047,0002,117,632
7Sep 5, 2026 09:383,88142,422,40831,169,0001,044,0002,117,632
8Sep 5, 2026 09:383,89642,720,80731,294,0001,044,0002,117,632
9Sep 5, 2026 09:383,90542,560,63131,367,0001,048,0002,117,632