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 27, 2026 05:53Victor MerckléVictor MerckléScore: 4,293Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 05:544,24643,613,19934,136,0001,108,0002,117,632stderr
2Aug 27, 2026 05:544,27043,733,09034,365,0001,079,0002,117,632stderr
3Aug 27, 2026 05:544,28143,893,76634,428,0001,108,0002,117,632stderr
4Aug 27, 2026 05:544,28343,911,04434,481,0001,076,0002,117,632stderr
5Aug 27, 2026 05:544,29343,950,44534,544,0001,091,0002,117,632stderr
6Aug 27, 2026 05:544,29644,110,47834,577,0001,080,0002,117,632stderr
7Aug 27, 2026 05:544,29844,051,83134,579,0001,096,0002,117,632stderr
8Aug 27, 2026 05:544,40144,894,51035,423,0001,112,0002,117,632stderr
9Aug 27, 2026 05:544,55046,154,56936,674,0001,099,0002,117,632stderr