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 listAug 15, 2026 20:01Tomislav TunkovicTomislav TunkovicScore: 4,320Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 20:014,31644,268,17235,825,000020,480
2Aug 15, 2026 20:014,31644,253,77135,824,000020,480
3Aug 15, 2026 20:014,31844,898,61135,843,000020,480
4Aug 15, 2026 20:014,31851,513,74235,846,000020,480
5Aug 15, 2026 20:014,32044,971,90035,856,000020,480
6Aug 15, 2026 20:014,32344,334,03235,889,000020,480
7Aug 15, 2026 20:014,32345,036,73035,889,000020,480
8Aug 15, 2026 20:014,32644,323,65135,912,000020,480
9Aug 15, 2026 20:014,33544,995,89035,982,000020,480