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 13:38Josu San MartinJosu San MartinScore: 4,233Success
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 13:394,21544,629,27433,943,0001,042,0002,113,536
2May 10, 2026 13:394,21943,170,29133,980,0001,041,0002,113,536
3May 10, 2026 13:394,22342,743,17933,985,0001,066,0002,113,536
4May 10, 2026 13:394,23344,261,04934,084,0001,055,0002,113,536
5May 10, 2026 13:394,23344,278,65534,088,0001,054,0002,113,536
6May 10, 2026 13:394,26243,966,57834,320,0001,062,0002,113,536
7May 10, 2026 13:394,26244,973,54934,322,0001,057,0002,113,536
8May 10, 2026 13:394,26343,967,20034,326,0001,062,0002,113,536
9May 10, 2026 13:394,33643,178,38134,950,0001,047,0002,113,536