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 listSep 8, 2026 10:16Victor MerckléVictor MerckléScore: 4,794Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 8, 2026 10:194,58346,618,70632,553,0005,487,00024,576stderr
2Sep 8, 2026 10:194,62746,947,70932,648,0005,757,0002,117,632stderr
3Sep 8, 2026 10:194,68047,485,32033,052,0005,800,0002,117,632stderr
4Sep 8, 2026 10:194,78648,331,05132,853,0006,877,0002,117,632stderr
5Sep 8, 2026 10:194,79450,206,97632,671,0007,125,0002,117,632stderr
6Sep 8, 2026 10:194,80848,431,44633,297,0006,617,0002,117,632stderr
7Sep 8, 2026 10:194,82048,506,47632,864,0007,142,0002,117,632stderr
8Sep 8, 2026 10:194,86648,939,99832,647,0007,743,0002,117,632stderr
9Sep 8, 2026 10:195,01650,265,65133,438,0008,196,0002,117,632stderr