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 24, 2026 22:52Victor MerckléVictor MerckléScore: 4,165Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 22:534,12642,674,52633,130,0001,122,0002,117,632stderr
2Aug 24, 2026 22:534,12842,655,05133,160,0001,107,0002,117,632stderr
3Aug 24, 2026 22:534,15542,942,82233,331,0001,161,0002,117,632stderr
4Aug 24, 2026 22:534,16242,880,68233,479,0001,071,0002,117,632stderr
5Aug 24, 2026 22:534,16543,173,83233,482,0001,089,0002,117,632stderr
6Aug 24, 2026 22:534,17743,031,05533,590,0001,085,0002,117,632stderr
7Aug 24, 2026 22:534,19943,234,82333,665,0001,190,0002,117,632stderr
8Aug 24, 2026 22:534,21543,384,35733,926,0001,061,0002,117,632stderr
9Aug 24, 2026 22:534,31944,304,87734,767,0001,083,0002,117,632stderr