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 26, 2026 00:58Victor MerckléVictor MerckléScore: 3,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 00:593,77639,751,50930,185,0001,163,0002,117,632stderr
2Aug 26, 2026 00:593,79039,824,96430,382,0001,075,0002,117,632stderr
3Aug 26, 2026 00:593,79139,895,65130,369,0001,103,0002,117,632stderr
4Aug 26, 2026 00:593,80339,938,63030,471,0001,097,0002,117,632stderr
5Aug 26, 2026 00:593,80839,990,11230,543,0001,071,0002,117,632stderr
6Aug 26, 2026 00:593,81339,980,51830,570,0001,085,0002,117,632stderr
7Aug 26, 2026 00:593,81740,155,50230,581,0001,105,0002,117,632stderr
8Aug 26, 2026 00:593,81939,862,76530,599,0001,103,0002,117,632stderr
9Aug 26, 2026 00:593,99541,764,21331,991,0001,168,0002,117,632stderr