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 22:29Victor 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 22:303,84340,381,50030,872,0001,029,0002,117,632stderr
2Aug 11, 2026 22:303,84440,301,10430,878,0001,034,0002,117,632stderr
3Aug 11, 2026 22:303,85141,210,22830,940,0001,030,0002,117,632stderr
4Aug 11, 2026 22:303,85240,450,44430,876,0001,103,0002,117,632stderr
5Aug 11, 2026 22:303,85340,345,12830,950,0001,035,0002,117,632stderr
6Aug 11, 2026 22:303,86340,439,74430,952,0001,117,0002,117,632stderr
7Aug 11, 2026 22:303,87641,671,18131,128,0001,047,0002,117,632stderr
8Aug 11, 2026 22:303,94241,115,24031,687,0001,034,0002,117,632stderr
9Aug 11, 2026 22:303,95941,259,81631,730,0001,136,0002,117,632stderr