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 14:27Victor MerckléVictor MerckléScore: 3,748Success
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 14:333,66238,910,51928,720,0001,682,00024,576stderr
2Sep 8, 2026 14:333,69839,272,61328,969,0001,727,00024,576stderr
3Sep 8, 2026 14:333,70039,168,10727,926,0002,788,0002,117,632stderr
4Sep 8, 2026 14:333,73539,426,83929,270,0001,732,00024,576stderr
5Sep 8, 2026 14:333,74840,237,02829,423,0001,693,00024,576stderr
6Sep 8, 2026 14:333,79340,197,85029,782,0001,702,00024,576stderr
7Sep 8, 2026 14:333,79539,991,23129,625,0001,877,00024,576stderr
8Sep 8, 2026 14:333,81140,890,11129,786,0001,847,00024,576stderr
9Sep 8, 2026 14:333,82040,824,80129,856,0001,853,00024,576stderr