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 05:45Victor MerckléVictor MerckléScore: 11,080Success
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 05:5311,069100,191,55490,785,0001,094,0002,113,536
2Aug 28, 2026 05:5311,069100,229,77590,853,0001,027,0002,113,536
3Aug 28, 2026 05:5311,069100,334,04990,764,0001,114,0002,113,536
4Aug 28, 2026 05:5311,072100,302,40990,789,0001,112,0002,113,536
5Aug 28, 2026 05:5311,080100,356,42890,847,0001,117,0002,113,536
6Aug 28, 2026 05:5311,083100,419,44490,869,0001,122,0002,113,536
7Aug 28, 2026 05:5311,112100,626,26391,197,0001,033,0002,113,536
8Aug 28, 2026 05:5311,120100,727,35991,258,0001,039,0002,113,536
9Aug 28, 2026 05:5311,159101,093,51991,616,0001,011,0002,113,536