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 27, 2026 00:35Victor MerckléVictor MerckléScore: 4,275Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 00:374,23843,509,47434,046,0001,134,0002,117,632stderr
2Aug 27, 2026 00:374,24443,574,21434,095,0001,132,0002,117,632stderr
3Aug 27, 2026 00:374,26743,818,28234,287,0001,134,0002,117,632stderr
4Aug 27, 2026 00:374,26844,049,39334,415,0001,011,0002,117,632stderr
5Aug 27, 2026 00:374,27543,838,72634,363,0001,123,0002,117,632stderr
6Aug 27, 2026 00:374,29043,990,75634,467,0001,143,0002,117,632stderr
7Aug 27, 2026 00:374,29545,176,30834,510,0001,146,0002,117,632stderr
8Aug 27, 2026 00:374,49445,624,98536,197,0001,109,0002,117,632stderr
9Aug 27, 2026 00:374,59046,409,55536,986,0001,118,0002,117,632stderr