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 01:11Victor MerckléVictor MerckléScore: 3,954Success
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 01:123,91440,777,45531,389,0001,102,0002,117,632stderr
2Aug 11, 2026 01:123,92440,902,59831,473,0001,099,0002,117,632stderr
3Aug 11, 2026 01:123,93940,960,53731,593,0001,106,0002,117,632stderr
4Aug 11, 2026 01:123,94541,774,32331,577,0001,170,0002,117,632stderr
5Aug 11, 2026 01:123,95440,999,01631,712,0001,112,0002,117,632stderr
6Aug 11, 2026 01:123,98441,260,39331,952,0001,116,0002,117,632stderr
7Aug 11, 2026 01:124,04941,942,96832,496,0001,113,0002,117,632stderr
8Aug 11, 2026 01:124,12142,514,85233,120,0001,087,0002,117,632stderr
9Aug 11, 2026 01:124,19443,096,55233,718,0001,095,0002,117,632stderr