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:30Tomislav TunkovicTomislav TunkovicScore: 4,369Success
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:334,35144,537,08336,121,000020,480
2Aug 15, 2026 20:334,35744,592,15136,169,000020,480
3Aug 15, 2026 20:334,35744,589,67536,169,000020,480
4Aug 15, 2026 20:334,36344,646,64736,214,000020,480
5Aug 15, 2026 20:334,36944,737,37636,268,000020,480
6Aug 15, 2026 20:334,37245,070,56836,291,000020,480
7Aug 15, 2026 20:334,37244,714,84736,288,000020,480
8Aug 15, 2026 20:334,38444,814,52436,388,000020,480
9Aug 15, 2026 20:334,38644,894,67135,410,0001,002,00020,480