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 28, 2026 06:24Victor MerckléVictor MerckléScore: 3,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 06:263,72639,280,91029,703,0001,229,0002,113,536
2Aug 28, 2026 06:263,73439,948,97629,738,0001,255,0002,113,536
3Aug 28, 2026 06:263,73939,320,41830,006,0001,029,0002,113,536
4Aug 28, 2026 06:263,76340,132,77330,019,0001,220,0002,113,536
5Aug 28, 2026 06:263,76839,579,66830,088,0001,193,0002,113,536
6Aug 28, 2026 06:263,77239,594,52530,146,0001,168,0002,113,536
7Aug 28, 2026 06:263,82740,029,59730,586,0001,185,0002,113,536
8Aug 28, 2026 06:263,95341,882,38231,609,0001,205,0002,113,536
9Aug 28, 2026 06:263,95641,764,95431,688,0001,155,0002,113,536