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 listAug 13, 2026 00:32Victor MerckléVictor MerckléScore: 3,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 00:333,73339,546,23129,798,0001,187,0002,117,632stderr
2Aug 13, 2026 00:333,74339,508,55429,937,0001,134,0002,117,632stderr
3Aug 13, 2026 00:333,75339,542,06730,025,0001,127,0002,117,632stderr
4Aug 13, 2026 00:333,75939,670,95730,049,0001,157,0002,117,632stderr
5Aug 13, 2026 00:333,77339,787,02630,250,0001,074,0002,117,632stderr
6Aug 13, 2026 00:333,78139,855,79330,218,0001,165,0002,117,632stderr
7Aug 13, 2026 00:333,78340,101,81730,325,0001,079,0002,117,632stderr
8Aug 13, 2026 00:333,80239,948,83330,485,0001,079,0002,117,632stderr
9Aug 13, 2026 00:333,80340,060,27730,462,0001,104,0002,117,632stderr