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:19Nao MinamiNao MinamiScore: 30,726Success
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:2030,717265,998,251253,948,0001,007,0002,113,536
2Oct 24, 2026 04:2030,722265,983,860253,985,0001,008,0002,113,536
3Oct 24, 2026 04:2030,723265,921,326253,993,0001,008,0002,113,536
4Oct 24, 2026 04:2030,724265,974,915253,006,0002,007,0002,113,536
5Oct 24, 2026 04:2030,726265,770,864254,028,0001,005,0002,113,536
6Oct 24, 2026 04:2030,730270,027,134254,059,0001,008,0002,113,536
7Oct 24, 2026 04:2030,740266,147,206254,139,0001,007,0002,113,536
8Oct 24, 2026 04:2030,743266,144,284253,167,0002,006,0002,113,536
9Oct 24, 2026 04:2030,743267,439,646253,161,0002,009,0002,113,536