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 listJul 6, 2026 06:17Victor MerckléVictor MerckléScore: 8,624Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 06:198,60879,456,77670,444,0001,005,0002,117,632stderr
2Jul 6, 2026 06:198,61079,465,28470,342,0001,127,0002,117,632stderr
3Jul 6, 2026 06:198,61779,543,68070,396,0001,126,0002,117,632stderr
4Jul 6, 2026 06:198,62279,649,28670,544,0001,021,0002,117,632stderr
5Jul 6, 2026 06:198,62479,666,26870,442,0001,141,0002,117,632stderr
6Jul 6, 2026 06:198,62879,651,33370,496,0001,123,0002,117,632stderr
7Jul 6, 2026 06:198,64679,746,12270,614,0001,154,0002,117,632stderr
8Jul 6, 2026 06:198,68980,141,67571,002,0001,117,0002,117,632stderr
9Jul 6, 2026 06:198,77682,181,70371,663,0001,185,0002,117,632stderr