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 13:14Victor MerckléVictor MerckléScore: 7,904Success
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 13:157,89675,855,38265,543,00002,113,536
2May 13, 2026 13:157,89773,012,05365,551,00002,113,536
3May 13, 2026 13:157,89775,007,37365,549,00002,113,536
4May 13, 2026 13:157,90375,767,77865,602,00002,113,536
5May 13, 2026 13:157,90473,677,53264,601,0001,009,0002,113,536
6May 13, 2026 13:157,90575,805,42564,613,0001,004,0002,113,536
7May 13, 2026 13:157,98875,255,99465,286,0001,016,0002,113,536
8May 13, 2026 13:158,04976,069,07365,765,0001,042,0002,113,536
9May 13, 2026 13:158,05777,005,29265,844,0001,031,0002,113,536