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 31, 2026 11:34timothygktimothygkScore: 9,823Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 11:399,44889,430,99266,029,00012,397,00053,248stderr
2Oct 31, 2026 11:399,51889,993,55166,381,00012,621,0002,150,400stderr
3Oct 31, 2026 11:399,52090,022,25166,404,00012,614,0002,150,400stderr
4Oct 31, 2026 11:399,73891,808,87467,570,00013,257,0002,150,400stderr
5Oct 31, 2026 11:399,82393,514,73469,255,00012,284,00053,248stderr
6Oct 31, 2026 11:399,83792,631,48669,012,00012,636,00053,248stderr
7Oct 31, 2026 11:399,93393,485,11970,105,00012,339,00053,248stderr
8Oct 31, 2026 11:399,97093,732,81469,892,00012,865,00053,248stderr
9Oct 31, 2026 11:399,97595,883,18569,589,00013,205,0002,150,400stderr