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 listMar 10, 2026 17:14caandocaandoScore: 5,088Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 17:145,04566,624,02939,832,0002,042,0002,265,088
2Mar 10, 2026 17:145,05469,711,57539,949,0001,997,0002,285,568
3Mar 10, 2026 17:145,08264,874,93840,174,0002,008,0002,285,568
4Mar 10, 2026 17:145,08870,011,79840,219,0002,010,0002,285,568
5Mar 10, 2026 17:145,09065,013,85040,235,0002,011,0002,285,568
6Mar 10, 2026 17:145,09964,902,87241,318,0001,007,0002,285,568