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 19:25Victor MerckléVictor MerckléScore: 5,186Success
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 19:265,11152,735,34241,405,0001,019,0002,117,632stderr
2Aug 28, 2026 19:265,11951,459,50541,471,0001,022,0002,117,632stderr
3Aug 28, 2026 19:265,12451,581,75441,504,0001,027,0002,117,632stderr
4Aug 28, 2026 19:265,17151,179,41841,883,0001,043,0002,117,632stderr
5Aug 28, 2026 19:265,18652,113,59442,015,0001,035,0002,117,632stderr
6Aug 28, 2026 19:265,19752,180,07042,097,0001,041,0002,117,632stderr
7Aug 28, 2026 19:265,19852,142,46942,113,0001,032,0002,117,632stderr
8Aug 28, 2026 19:265,21251,515,32642,224,0001,040,0002,117,632stderr
9Aug 28, 2026 19:265,27952,741,02642,796,0001,022,0002,117,632stderr