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 20, 2026 05:36M-RochatM-RochatScore: 12,621Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 05:3612,518116,303,822101,893,0002,013,0002,113,536
2May 20, 2026 05:3612,541116,605,797101,769,0002,324,0002,113,536
3May 20, 2026 05:3612,569116,599,249101,988,0002,338,0002,113,536
4May 20, 2026 05:3612,613114,600,428102,619,0002,076,0002,113,536
5May 20, 2026 05:3612,621114,110,470102,712,0002,044,0002,113,536
6May 20, 2026 05:3612,628116,323,966102,738,0002,080,0002,113,536
7May 20, 2026 05:3612,631115,791,998102,772,0002,069,0002,113,536
8May 20, 2026 05:3612,658115,504,541102,993,0002,069,0002,113,536
9May 20, 2026 05:3612,667117,455,742103,054,0002,088,0002,113,536