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 28, 2026 18:34Victor MerckléVictor MerckléScore: 7,067Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 18:347,01866,675,23957,232,0001,022,0002,117,632stderr
2Aug 28, 2026 18:347,04866,838,07857,492,0001,007,0002,117,632stderr
3Aug 28, 2026 18:347,05767,019,55257,563,0001,014,0002,117,632stderr
4Aug 28, 2026 18:347,06467,655,12657,627,0001,007,0002,117,632stderr
5Aug 28, 2026 18:347,06767,690,18457,652,0001,011,0002,117,632stderr
6Aug 28, 2026 18:347,08067,730,50857,748,0001,016,0002,117,632stderr
7Aug 28, 2026 18:347,09467,916,31257,869,0001,014,0002,117,632stderr
8Aug 28, 2026 18:347,10267,924,69357,946,0001,006,0002,117,632stderr
9Aug 28, 2026 18:347,12968,242,30858,011,0001,163,0002,117,632stderr