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 listJul 14, 2026 13:04КатунКатунScore: 27,966Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 13:0527,819240,547,162168,890,00062,013,0002,113,536
2Jul 14, 2026 13:0527,829240,611,859168,985,00062,003,0002,113,536
3Jul 14, 2026 13:0527,900241,171,938168,596,00062,977,0002,113,536
4Jul 14, 2026 13:0527,953243,301,816169,202,00062,808,0002,113,536
5Jul 14, 2026 13:0527,966241,645,545168,858,00063,261,0002,113,536
6Jul 14, 2026 13:0527,980241,853,042169,088,00063,146,0002,113,536
7Jul 14, 2026 13:0528,006242,040,733168,946,00063,512,0002,113,536
8Jul 14, 2026 13:0528,017242,094,416169,505,00063,038,0002,113,536
9Jul 14, 2026 13:0528,022242,246,215169,000,00063,586,0002,113,536