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 18, 2026 11:04Victor MerckléVictor MerckléError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 11:05063,599,87254,318,0001,055,0002,113,536expected "53690804975264621 ", got "53690781935264621 "
2May 18, 2026 11:056,66765,327,21154,288,0001,055,0002,113,536
3May 18, 2026 11:056,67064,298,22254,300,0001,064,0002,113,536
4May 18, 2026 11:056,67164,566,55654,305,0001,071,0002,113,536
5May 18, 2026 11:056,67363,389,82654,342,0001,044,0002,113,536
6May 18, 2026 11:056,70365,619,78154,585,0001,051,0002,113,536
7May 18, 2026 11:056,70663,392,97054,607,0001,058,0002,113,536
8May 18, 2026 11:056,72165,803,18354,745,0001,042,0002,113,536
9May 18, 2026 11:056,72765,469,29054,779,0001,061,0002,113,536