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 listMay 9, 2026 22:18Josu San MartinJosu San MartinScore: 5,533Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2026 22:195,42261,455,89643,923,0001,080,0002,322,432
2May 9, 2026 22:195,42361,849,64843,924,0001,093,0002,318,336
3May 9, 2026 22:195,47161,233,52944,317,0001,095,0002,318,336
4May 9, 2026 22:195,51764,049,24544,646,0001,151,0002,314,240
5May 9, 2026 22:195,53364,298,99544,751,0001,175,0002,322,432
6May 9, 2026 22:195,57460,873,20445,245,0001,022,0002,318,336
7May 9, 2026 22:195,61063,673,31945,441,0001,127,0002,314,240
8May 9, 2026 22:195,61463,927,88945,499,0001,098,0002,314,240
9May 9, 2026 22:195,64065,153,90845,694,0001,124,0002,322,432