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 15, 2026 06:00Tomislav TunkovicTomislav TunkovicScore: 6,253Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 06:006,22259,924,26450,633,0001,015,0002,117,632
2Aug 15, 2026 06:006,22460,033,55450,645,0001,015,0002,117,632
3Aug 15, 2026 06:006,23760,146,71550,743,0001,027,0002,117,632
4Aug 15, 2026 06:006,24360,241,37050,796,0001,028,0002,117,632
5Aug 15, 2026 06:006,25360,100,05250,878,0001,027,0002,117,632
6Aug 15, 2026 06:006,25560,504,12950,897,0001,026,0002,117,632
7Aug 15, 2026 06:006,25560,334,38650,897,0001,026,0002,117,632
8Aug 15, 2026 06:006,25760,344,65350,922,0001,015,0002,117,632
9Aug 15, 2026 06:006,26060,302,64250,933,0001,028,0002,117,632