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:21KacpxerKacpxerScore: 7,959Success
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:227,70873,264,77062,944,0001,034,0002,117,632
2Oct 16, 2026 18:227,83974,138,91964,042,0001,025,0002,117,632
3Oct 16, 2026 18:227,87874,514,81464,291,0001,098,0002,117,632
4Oct 16, 2026 18:227,92074,791,22764,707,0001,029,0002,117,632
5Oct 16, 2026 18:227,95976,528,64965,019,0001,041,0002,117,632
6Oct 16, 2026 18:228,04775,872,14665,706,0001,091,0002,117,632
7Oct 16, 2026 18:228,05676,034,92265,784,0001,086,0002,117,632
8Oct 16, 2026 18:228,12476,530,92166,339,0001,095,0002,117,632
9Oct 16, 2026 18:228,28277,799,60567,735,0001,011,0002,117,632