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 07:55Victor MerckléVictor MerckléScore: 6,988Success
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 07:556,97466,033,79557,885,00002,113,536
2May 15, 2026 07:556,98167,493,34857,948,00002,113,536
3May 15, 2026 07:556,98267,221,26756,927,0001,030,0002,113,536
4May 15, 2026 07:556,98666,836,39956,940,0001,048,0002,113,536
5May 15, 2026 07:556,98865,880,50357,005,0001,001,0002,113,536
6May 15, 2026 07:556,99165,383,64957,019,0001,013,0002,113,536
7May 15, 2026 07:556,99466,792,35756,902,0001,151,0002,113,536
8May 15, 2026 07:557,03267,902,51657,363,0001,005,0002,113,536
9May 15, 2026 07:557,09469,117,88558,885,00002,113,536