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 13, 2026 22:39flavio87flavio87Score: 6,137Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 22:396,10160,752,70349,603,0001,036,0002,113,536
2May 13, 2026 22:396,10659,995,79449,667,0001,021,0002,113,536
3May 13, 2026 22:396,11959,580,95449,776,0001,018,0002,113,536
4May 13, 2026 22:396,12060,842,91649,769,0001,032,0002,113,536
5May 13, 2026 22:396,13760,147,20349,918,0001,024,0002,113,536
6May 13, 2026 22:396,15560,054,26250,075,0001,017,0002,113,536
7May 13, 2026 22:396,19858,694,07550,429,0001,020,0002,113,536
8May 13, 2026 22:396,21259,790,25750,546,0001,017,0002,113,536
9May 13, 2026 22:396,25259,639,04150,877,0001,016,0002,113,536