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 15, 2026 22:26Victor MerckléVictor MerckléScore: 6,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 22:266,98766,137,50756,953,0001,047,0002,113,536
2May 15, 2026 22:266,98865,757,24656,963,0001,043,0002,113,536
3May 15, 2026 22:266,98868,515,36556,963,0001,044,0002,113,536
4May 15, 2026 22:266,99165,363,29457,022,0001,011,0002,113,536
5May 15, 2026 22:266,99567,599,58157,031,0001,030,0002,113,536
6May 15, 2026 22:266,99666,348,60057,059,0001,008,0002,113,536
7May 15, 2026 22:266,99767,634,13957,062,0001,014,0002,113,536
8May 15, 2026 22:267,01766,189,09457,210,0001,038,0002,113,536
9May 15, 2026 22:267,04266,204,09857,433,0001,019,0002,113,536