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:24Tomislav TunkovicTomislav TunkovicScore: 4,365Success
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:254,35844,648,83436,174,000020,480
2Aug 15, 2026 20:254,35944,671,08836,180,000020,480
3Aug 15, 2026 20:254,36044,661,48536,188,000020,480
4Aug 15, 2026 20:254,36244,655,57436,205,000020,480
5Aug 15, 2026 20:254,36544,714,78236,237,000020,480
6Aug 15, 2026 20:254,36544,694,65936,236,000020,480
7Aug 15, 2026 20:254,37344,806,53736,301,000020,480
8Aug 15, 2026 20:254,38744,833,49236,418,000020,480
9Aug 15, 2026 20:255,58554,840,63146,363,000020,480