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 24, 2026 04:10Nao MinamiNao MinamiScore: 32,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 24, 2026 04:1132,289278,991,198266,994,0001,006,0002,113,536
2Oct 24, 2026 04:1132,292278,919,065267,027,0001,003,0002,113,536
3Oct 24, 2026 04:1132,294279,073,080267,036,0001,006,0002,113,536
4Oct 24, 2026 04:1132,297279,024,202267,066,0001,005,0002,113,536
5Oct 24, 2026 04:1132,297281,167,447266,053,0002,014,0002,113,536
6Oct 24, 2026 04:1132,300279,561,032266,091,0002,001,0002,113,536
7Oct 24, 2026 04:1132,304279,020,020267,124,0001,006,0002,113,536
8Oct 24, 2026 04:1132,307279,117,502267,148,0001,004,0002,113,536
9Oct 24, 2026 04:1132,311279,227,787267,183,0001,005,0002,113,536