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 20, 2026 17:46Victor MerckléVictor MerckléScore: 5,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 17:484,98352,347,35940,295,0001,072,0002,117,632stderr
2May 20, 2026 17:484,99649,316,18340,447,0001,021,0002,117,632stderr
3May 20, 2026 17:485,00350,781,83940,511,0001,019,0002,117,632stderr
4May 20, 2026 17:485,00749,810,46340,554,0001,006,0002,117,632stderr
5May 20, 2026 17:485,01749,443,58640,642,0001,003,0002,117,632stderr
6May 20, 2026 17:485,01849,291,91040,637,0001,016,0002,117,632stderr
7May 20, 2026 17:485,05550,238,94040,928,0001,033,0002,117,632stderr
8May 20, 2026 17:485,14050,526,41841,655,0001,011,0002,117,632stderr
9May 20, 2026 17:485,17652,702,64641,938,0001,031,0002,117,632stderr