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 7, 2026 16:25Victor MerckléVictor MerckléScore: 5,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 16:275,53754,454,44431,477,00014,488,0002,117,632stderr
2Sep 7, 2026 16:275,72355,724,18532,955,00014,553,0002,117,632stderr
3Sep 7, 2026 16:275,74555,966,99132,992,00014,693,0002,117,632stderr
4Sep 7, 2026 16:275,76656,375,30531,997,00015,865,00024,576stderr
5Sep 7, 2026 16:275,88757,136,11231,182,00017,681,0002,117,632stderr
6Sep 7, 2026 16:276,04258,727,52733,000,00017,149,0002,117,632stderr
7Sep 7, 2026 16:276,65564,404,78533,385,00021,856,0002,117,632stderr
8Sep 7, 2026 16:276,75365,325,11731,785,00024,271,0002,117,632stderr
9Sep 7, 2026 16:276,84865,976,74433,078,00023,766,0002,117,632stderr