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 19, 2026 13:45Kevin HeaveyKevin HeaveyScore: 3,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 13:463,62639,718,05528,903,0001,194,0002,113,536
2Jul 19, 2026 13:463,63739,794,49928,989,0001,205,0002,113,536
3Jul 19, 2026 13:463,64139,853,15829,068,0001,159,0002,113,536
4Jul 19, 2026 13:463,68440,186,67129,441,0001,143,0002,113,536
5Jul 19, 2026 13:463,70040,321,92929,578,0001,133,0002,113,536
6Jul 19, 2026 13:463,73340,685,99829,827,0001,164,0002,113,536
7Jul 19, 2026 13:463,83041,436,55330,635,0001,159,0002,113,536
8Jul 19, 2026 13:463,90942,080,36531,282,0001,170,0002,113,536
9Jul 19, 2026 13:463,92442,797,09331,533,0001,043,0002,113,536