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 25, 2026 13:13Victor MerckléVictor MerckléScore: 4,202Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 13:144,11942,712,58332,986,0001,205,0002,117,632stderr
2Aug 25, 2026 13:144,13742,746,29133,322,0001,017,0002,117,632stderr
3Aug 25, 2026 13:144,16142,964,84233,426,0001,117,0002,117,632stderr
4Aug 25, 2026 13:144,18443,097,13433,699,0001,033,0002,117,632stderr
5Aug 25, 2026 13:144,20244,381,18833,700,0001,178,0002,117,632stderr
6Aug 25, 2026 13:144,21243,404,92233,941,0001,020,0002,117,632stderr
7Aug 25, 2026 13:144,25743,736,88734,300,0001,041,0002,117,632stderr
8Aug 25, 2026 13:144,28743,996,58034,557,0001,031,0002,117,632stderr
9Aug 25, 2026 13:144,37245,235,10935,263,0001,025,0002,117,632stderr