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 04:45Josu San MartinJosu San MartinScore: 3,873Success
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 04:463,86642,475,63731,017,0001,079,0002,113,536
2May 11, 2026 04:463,86939,794,12731,042,0001,075,0002,113,536
3May 11, 2026 04:463,87141,252,49131,040,0001,092,0002,113,536
4May 11, 2026 04:463,87340,622,94031,066,0001,087,0002,113,536
5May 11, 2026 04:463,87341,643,37831,078,0001,068,0002,113,536
6May 11, 2026 04:463,87441,243,43531,058,0001,101,0002,113,536
7May 11, 2026 04:463,87842,449,06131,105,0001,085,0002,113,536
8May 11, 2026 04:463,88141,219,86631,118,0001,098,0002,113,536
9May 11, 2026 04:463,90240,112,34831,317,0001,076,0002,113,536