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 18:57Sergey SerebryakovSergey SerebryakovScore: 11,837Success
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 18:5711,598120,167,41393,253,0003,008,0002,396,160
2Mar 10, 2026 18:5711,605118,270,16795,317,0001,003,0002,265,088
3Mar 10, 2026 18:5711,619116,741,40796,438,00002,514,944
4Mar 10, 2026 18:5711,837124,690,85194,235,0004,010,0002,265,088
5Mar 10, 2026 18:5711,849122,818,24596,337,0002,007,0002,396,160
6Mar 10, 2026 18:5711,876122,641,73797,574,000995,0002,269,184