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 listFeb 14, 2026 09:29Daniel MastalerzDaniel MastalerzScore: 6,575Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2026 09:296,46482,217,03951,626,0002,024,0002,265,088
2Feb 14, 2026 09:296,48386,844,05051,813,0001,992,0002,523,136
3Feb 14, 2026 09:296,48379,572,20649,827,0003,986,0002,379,776
4Feb 14, 2026 09:296,57580,685,32052,550,0002,021,0002,310,144
5Feb 14, 2026 09:296,60683,182,77552,836,0001,993,0002,269,184
6Feb 14, 2026 09:296,61179,622,14450,884,0003,990,0002,519,040