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 23, 2026 18:46Victor MerckléVictor MerckléScore: 3,788Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 18:473,74239,511,07829,897,0001,164,0002,117,632stderr
2Aug 23, 2026 18:473,76340,994,93930,142,0001,095,0002,117,632stderr
3Aug 23, 2026 18:473,77539,711,82030,237,0001,096,0002,117,632stderr
4Aug 23, 2026 18:473,77539,784,66230,170,0001,166,0002,117,632stderr
5Aug 23, 2026 18:473,78839,838,01130,361,0001,085,0002,117,632stderr
6Aug 23, 2026 18:473,78839,889,31330,428,0001,017,0002,117,632stderr
7Aug 23, 2026 18:473,78939,798,36430,371,0001,080,0002,117,632stderr
8Aug 23, 2026 18:473,96049,423,98831,749,0001,126,0002,117,632stderr
9Aug 23, 2026 18:473,99343,301,23631,989,0001,159,0002,117,632stderr