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 15, 2026 23:12wnwnScore: 9,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2026 23:128,35587,585,49862,315,0007,035,0002,461,696
2Feb 15, 2026 23:128,38498,711,17563,540,0006,051,0002,338,816
3Feb 15, 2026 23:128,55895,655,75663,028,0008,003,0002,371,584
4Feb 15, 2026 23:129,608108,475,37170,772,0008,971,0002,461,696
5Feb 15, 2026 23:129,785106,702,04070,190,00011,029,0002,461,696
6Feb 15, 2026 23:129,827112,399,02473,510,0008,055,0002,465,792