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 16, 2026 18:56marko1597marko1597Score: 5,147Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 19:085,10450,680,60441,178,0001,192,0002,117,632
2Aug 16, 2026 19:085,11050,767,66341,226,0001,192,0002,117,632
3Aug 16, 2026 19:085,12751,425,74041,362,0001,194,0002,117,632
4Aug 16, 2026 19:085,13050,796,60441,576,0001,009,0002,117,632
5Aug 16, 2026 19:085,14751,028,97741,706,0001,016,0002,117,632
6Aug 16, 2026 19:085,19351,331,96242,100,0001,006,0002,117,632
7Aug 16, 2026 19:085,19951,422,74241,991,0001,165,0002,117,632
8Aug 16, 2026 19:085,22951,609,73642,324,0001,080,0002,117,632
9Aug 16, 2026 19:085,24851,887,18142,539,0001,021,0002,117,632