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 11, 2026 15:49Victor MerckléVictor MerckléScore: 6,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 15:506,72964,279,97954,778,0001,076,0002,117,632stderr
2Aug 11, 2026 15:506,73764,305,89554,899,0001,026,0002,117,632stderr
3Aug 11, 2026 15:506,73764,649,36454,896,0001,027,0002,117,632stderr
4Aug 11, 2026 15:506,73964,384,19954,849,0001,087,0002,117,632stderr
5Aug 11, 2026 15:506,74364,343,41554,926,0001,042,0002,117,632stderr
6Aug 11, 2026 15:506,74664,381,60454,984,0001,009,0002,117,632stderr
7Aug 11, 2026 15:506,74764,376,72654,946,0001,060,0002,117,632stderr
8Aug 11, 2026 15:506,75164,461,50654,903,0001,135,0002,117,632stderr
9Aug 11, 2026 15:506,85765,306,68455,908,0001,007,0002,117,632stderr