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 5, 2026 02:39FrederickFrederickScore: 7,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 5, 2026 02:397,09870,045,62057,887,0001,033,0002,113,536
2Oct 5, 2026 02:397,38071,752,51360,227,0001,033,0002,113,536
3Oct 5, 2026 02:397,59373,840,01762,011,0001,015,0002,113,536
4Oct 5, 2026 02:397,70975,182,32262,968,0001,024,0002,113,536
5Oct 5, 2026 02:397,76774,976,72063,455,0001,015,0002,113,536
6Oct 5, 2026 02:397,77975,006,79363,554,0001,016,0002,113,536
7Oct 5, 2026 02:397,81675,485,99763,861,0001,015,0002,113,536
8Oct 5, 2026 02:397,83676,291,79664,022,0001,017,0002,113,536
9Oct 5, 2026 02:398,52781,390,00969,764,0001,013,0002,113,536