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 listOct 16, 2026 18:46e1011e1011Score: 55,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:4655,602472,019,489460,499,0001,005,0002,113,536
2Oct 16, 2026 18:4655,609472,036,448460,552,0001,003,0002,113,536
3Oct 16, 2026 18:4655,612472,132,617460,584,0001,003,0002,113,536
4Oct 16, 2026 18:4655,620472,310,626460,649,0001,005,0002,113,536
5Oct 16, 2026 18:4655,620472,238,449460,645,0001,004,0002,113,536
6Oct 16, 2026 18:4655,628472,271,017460,711,0001,004,0002,113,536
7Oct 16, 2026 18:4655,632472,455,712460,747,0001,004,0002,113,536
8Oct 16, 2026 18:4655,635472,333,140460,774,0001,004,0002,113,536
9Oct 16, 2026 18:4655,649472,398,770460,889,0001,004,0002,113,536