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 11, 2026 18:55Victor MerckléVictor MerckléScore: 3,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 18:563,83340,212,98630,784,0001,037,0002,117,632stderr
2Aug 11, 2026 18:563,84140,276,07730,823,0001,058,0002,117,632stderr
3Aug 11, 2026 18:563,85040,377,87530,917,0001,045,0002,117,632stderr
4Aug 11, 2026 18:563,85240,400,00030,785,0001,192,0002,117,632stderr
5Aug 11, 2026 18:563,85340,370,10330,819,0001,161,0002,117,632stderr
6Aug 11, 2026 18:563,85440,333,84830,969,0001,023,0002,117,632stderr
7Aug 11, 2026 18:563,86040,448,44030,893,0001,146,0002,117,632stderr
8Aug 11, 2026 18:563,89140,665,58231,171,0001,132,0002,117,632stderr
9Aug 11, 2026 18:563,89440,693,22531,295,0001,028,0002,117,632stderr