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 04:20Victor MerckléVictor MerckléScore: 7,022Success
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 04:217,01465,526,64557,204,0001,013,0002,113,536
2May 15, 2026 04:217,01567,578,53858,231,00002,113,536
3May 15, 2026 04:217,01665,613,98457,219,0001,021,0002,113,536
4May 15, 2026 04:217,01966,195,76957,245,0001,018,0002,113,536
5May 15, 2026 04:217,02267,835,20257,279,0001,004,0002,113,536
6May 15, 2026 04:217,02367,948,25257,243,0001,050,0002,113,536
7May 15, 2026 04:217,06866,032,26857,667,0001,001,0002,113,536
8May 15, 2026 04:217,07566,048,24057,694,0001,031,0002,113,536
9May 15, 2026 04:217,13366,519,43659,210,00002,113,536