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 2, 2026 17:25Andrey TsvetkovAndrey TsvetkovScore: 61,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 17:2761,604523,027,946509,209,0002,106,0002,138,112
2Aug 2, 2026 17:2761,643522,550,970509,500,0002,138,0002,138,112
3Aug 2, 2026 17:2761,676522,716,468509,756,0002,159,0002,138,112
4Aug 2, 2026 17:2761,707522,987,350509,007,0003,162,0002,138,112
5Aug 2, 2026 17:2761,708522,601,836508,932,0003,252,0002,138,112
6Aug 2, 2026 17:2761,721523,327,457509,088,0003,199,0002,138,112
7Aug 2, 2026 17:2761,788523,869,666509,678,0003,170,0002,138,112
8Aug 2, 2026 17:2761,841523,924,749510,121,0003,160,0002,138,112
9Aug 2, 2026 17:2761,866524,721,391510,321,0003,168,0002,138,112