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 11, 2026 00:32Josu 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 11, 2026 00:32042,376,08832,879,0001,089,0002,113,536expected "53684738865744451 ", got "53684738353744451 "
2May 11, 2026 00:32042,107,04732,927,0001,081,0002,113,536expected "53684848734543826 ", got "53684848478543826 "
3May 11, 2026 00:324,08143,686,72532,805,0001,068,0002,113,536
4May 11, 2026 00:324,09243,291,67232,871,0001,093,0002,113,536
5May 11, 2026 00:324,10643,583,46033,002,0001,082,0002,113,536
6May 11, 2026 00:324,10941,755,82433,037,0001,071,0002,113,536
7May 11, 2026 00:324,11344,433,83133,081,0001,058,0002,113,536
8May 11, 2026 00:324,12941,917,17733,182,0001,090,0002,113,536
9May 11, 2026 00:324,13242,320,91533,218,0001,078,0002,113,536