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:00Sergey SerebryakovSergey SerebryakovScore: 8,834Success
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:008,01789,968,45365,530,0001,008,0002,273,280
2Mar 10, 2026 17:008,02090,614,47065,561,0001,008,0002,396,160
3Mar 10, 2026 17:008,02292,686,11265,573,0001,008,0002,273,280
4Mar 10, 2026 17:008,83495,387,08272,317,0001,004,0002,273,280
5Mar 10, 2026 17:008,863103,654,47273,564,00002,400,256
6Mar 10, 2026 17:008,86499,296,41573,568,00002,273,280