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 22:46Victor MerckléVictor MerckléScore: 3,872Success
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 22:473,85040,356,40230,836,0001,126,0002,117,632stderr
2Aug 11, 2026 22:473,85440,384,03930,942,0001,054,0002,117,632stderr
3Aug 11, 2026 22:473,85540,404,08030,899,0001,100,0002,117,632stderr
4Aug 11, 2026 22:473,86140,469,38331,003,0001,049,0002,117,632stderr
5Aug 11, 2026 22:473,87240,624,11231,105,0001,040,0002,117,632stderr
6Aug 11, 2026 22:473,87440,590,41331,069,0001,093,0002,117,632stderr
7Aug 11, 2026 22:473,89240,685,79731,265,0001,043,0002,117,632stderr
8Aug 11, 2026 22:473,95441,282,48631,680,0001,144,0002,117,632stderr
9Aug 11, 2026 22:473,98441,519,96631,925,0001,146,0002,117,632stderr