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 listMay 10, 2026 05:53Josu San MartinJosu San MartinScore: 4,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 05:534,08951,256,30932,829,0001,116,0002,478,080
2May 10, 2026 05:534,10449,677,00032,917,0001,147,0002,494,464
3May 10, 2026 05:534,11249,518,91732,981,0001,149,0002,486,272
4May 10, 2026 05:534,12151,477,82633,150,0001,056,0002,494,464
5May 10, 2026 05:534,12251,861,45033,157,0001,062,0002,486,272
6May 10, 2026 05:534,12750,668,22433,204,0001,053,0002,482,176
7May 10, 2026 05:534,12951,370,14933,201,0001,076,0002,482,176
8May 10, 2026 05:534,13649,990,60733,272,0001,058,0002,494,464
9May 10, 2026 05:534,26050,641,32534,320,0001,042,0002,482,176