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 18:57Victor MerckléVictor MerckléScore: 4,489Success
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 18:584,42345,727,33835,568,0001,151,0002,117,632stderr
2Aug 27, 2026 18:584,42644,962,74035,571,0001,167,0002,117,632stderr
3Aug 27, 2026 18:584,45545,241,74535,829,0001,152,0002,117,632stderr
4Aug 27, 2026 18:584,46445,504,31935,938,0001,115,0002,117,632stderr
5Aug 27, 2026 18:584,48946,286,57236,031,0001,231,0002,117,632stderr
6Aug 27, 2026 18:584,49445,525,78936,227,0001,081,0002,117,632stderr
7Aug 27, 2026 18:584,55546,119,31636,649,0001,158,0002,117,632stderr
8Aug 27, 2026 18:584,62946,732,80637,414,0001,013,0002,117,632stderr
9Aug 27, 2026 18:585,13359,149,63941,534,0001,076,0002,117,632stderr