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 22:42Victor MerckléVictor MerckléScore: 7,604Success
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 22:427,59972,523,91662,067,0001,010,0002,113,536
2May 13, 2026 22:427,60272,117,41262,088,0001,011,0002,113,536
3May 13, 2026 22:427,60374,421,02762,098,0001,007,0002,113,536
4May 13, 2026 22:427,60370,348,60362,059,0001,046,0002,113,536
5May 13, 2026 22:427,60473,375,27962,119,0001,002,0002,113,536
6May 13, 2026 22:427,60771,219,42562,116,0001,026,0002,113,536
7May 13, 2026 22:427,60772,421,57262,107,0001,032,0002,113,536
8May 13, 2026 22:427,61071,367,67362,119,0001,048,0002,113,536
9May 13, 2026 22:427,61371,146,46862,154,0001,035,0002,113,536