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 22:59Victor MerckléVictor MerckléScore: 4,400Success
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 23:004,37344,654,97135,284,0001,017,0002,117,632stderr
2Aug 11, 2026 23:004,37844,690,87935,306,0001,034,0002,117,632stderr
3Aug 11, 2026 23:004,38144,791,95035,320,0001,049,0002,117,632stderr
4Aug 11, 2026 23:004,38744,582,90535,387,0001,030,0002,117,632stderr
5Aug 11, 2026 23:004,40045,005,27735,380,0001,142,0002,117,632stderr
6Aug 11, 2026 23:004,40144,941,15735,509,0001,023,0002,117,632stderr
7Aug 11, 2026 23:004,41344,856,67435,492,0001,142,0002,117,632stderr
8Aug 11, 2026 23:004,43344,945,27335,692,0001,107,0002,117,632stderr
9Aug 11, 2026 23:004,47845,601,96336,041,0001,128,0002,117,632stderr