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 19:44Victor MerckléVictor MerckléScore: 3,880Success
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 19:453,85940,459,32330,796,0001,240,0002,117,632stderr
2Aug 11, 2026 19:453,86840,566,40330,956,0001,151,0002,117,632stderr
3Aug 11, 2026 19:453,87140,522,91331,000,0001,131,0002,117,632stderr
4Aug 11, 2026 19:453,87940,612,06631,183,0001,015,0002,117,632stderr
5Aug 11, 2026 19:453,88040,571,92131,085,0001,124,0002,117,632stderr
6Aug 11, 2026 19:453,88740,777,75231,025,0001,242,0002,117,632stderr
7Aug 11, 2026 19:453,90240,794,76231,259,0001,135,0002,117,632stderr
8Aug 11, 2026 19:453,96441,367,40531,892,0001,017,0002,117,632stderr
9Aug 11, 2026 19:454,00141,586,90731,956,0001,260,0002,117,632stderr