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 listJul 8, 2026 11:51Victor MerckléVictor MerckléScore: 8,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2026 11:528,87981,624,56172,558,0001,142,0002,117,632stderr
2Jul 8, 2026 11:528,91582,002,50572,861,0001,138,0002,117,632stderr
3Jul 8, 2026 11:528,92182,044,49072,948,0001,097,0002,117,632stderr
4Jul 8, 2026 11:528,94082,060,77273,077,0001,126,0002,117,632stderr
5Jul 8, 2026 11:528,96082,240,78573,328,0001,046,0002,117,632stderr
6Jul 8, 2026 11:528,96582,253,80773,294,0001,118,0002,117,632stderr
7Jul 8, 2026 11:528,96682,303,62673,416,0001,003,0002,117,632stderr
8Jul 8, 2026 11:529,03784,519,93873,962,0001,049,0002,117,632stderr
9Jul 8, 2026 11:529,04282,904,09373,935,0001,119,0002,117,632stderr