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 22, 2026 15:41Dominique GarmierDominique GarmierScore: 8,922Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 19:118,80197,017,94871,049,0002,001,0002,342,912
2Mar 22, 2026 15:418,829100,993,45371,274,0002,007,0002,301,952
3Mar 22, 2026 19:118,843103,817,95172,392,0001,005,0002,297,856
4Mar 22, 2026 15:418,922100,327,64172,054,0002,001,0002,334,720
5Mar 22, 2026 19:118,991105,085,55673,614,0001,008,0002,293,760
6Mar 22, 2026 15:419,034103,471,72173,986,000999,0002,342,912