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 12, 2026 03:15Josu San MartinJosu San MartinError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 03:15043,036,67232,647,0001,091,0002,113,536expected "53684924915792258 ", got "53684924982956773 "
2May 12, 2026 03:154,06043,205,11432,607,0001,092,0002,113,536
3May 12, 2026 03:154,06043,199,13832,624,0001,075,0002,113,536
4May 12, 2026 03:154,06042,421,87232,639,0001,063,0002,113,536
5May 12, 2026 03:154,07741,184,29032,785,0001,058,0002,113,536
6May 12, 2026 03:154,07941,827,95932,759,0001,100,0002,113,536
7May 12, 2026 03:154,08143,276,43332,804,0001,075,0002,113,536
8May 12, 2026 03:154,08142,490,73832,804,0001,071,0002,113,536
9May 12, 2026 03:154,09344,131,71532,869,0001,104,0002,113,536