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 listSep 6, 2026 15:23Kevin HeaveyKevin HeaveyScore: 3,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 6, 2026 15:263,77541,285,22430,267,0001,073,0002,129,920
2Sep 6, 2026 15:263,79941,472,73829,142,0002,394,0002,183,168
3Sep 6, 2026 15:263,83841,729,71130,796,0001,062,0002,129,920
4Sep 6, 2026 15:263,89142,244,34231,237,0001,060,0002,129,920
5Sep 6, 2026 15:263,89542,318,48529,950,0002,379,0002,183,168
6Sep 6, 2026 15:263,95842,881,80030,428,0002,429,0002,183,168
7Sep 6, 2026 15:263,99743,188,39931,124,0002,057,0002,129,920
8Sep 6, 2026 15:264,00043,232,90831,889,0001,316,0002,129,920
9Sep 6, 2026 15:264,01243,245,35531,108,0002,196,0002,183,168