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 26, 2026 20:40Victor MerckléVictor MerckléScore: 7,490Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:407,45170,120,91760,700,0001,146,0002,113,536
2Aug 26, 2026 20:407,48070,375,65560,952,0001,138,0002,113,536
3Aug 26, 2026 20:407,48270,399,37961,002,0001,104,0002,113,536
4Aug 26, 2026 20:407,48671,148,01661,008,0001,133,0002,113,536
5Aug 26, 2026 20:407,49070,378,78761,007,0001,161,0002,113,536
6Aug 26, 2026 20:407,55571,745,82961,573,0001,138,0002,113,536
7Aug 26, 2026 20:407,58171,197,54261,851,0001,072,0002,113,536
8Aug 26, 2026 20:407,59871,523,85961,988,0001,080,0002,113,536
9Aug 26, 2026 20:407,71072,289,77062,867,0001,126,0002,113,536