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 26, 2026 16:30Victor MerckléVictor MerckléScore: 3,806Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 16:313,74039,205,00829,897,0001,152,0002,117,632stderr
2Aug 26, 2026 16:313,74540,223,91329,931,0001,158,0002,117,632stderr
3Aug 26, 2026 16:313,74839,484,55629,989,0001,122,0002,117,632stderr
4Aug 26, 2026 16:313,77640,490,85130,145,0001,203,0002,117,632stderr
5Aug 26, 2026 16:313,80641,925,02430,425,0001,166,0002,117,632stderr
6Aug 26, 2026 16:313,80639,822,19830,577,0001,019,0002,117,632stderr
7Aug 26, 2026 16:313,82039,839,73730,648,0001,061,0002,117,632stderr
8Aug 26, 2026 16:313,91540,673,34531,335,0001,161,0002,117,632stderr
9Aug 26, 2026 16:314,04041,764,18632,460,0001,074,0002,117,632stderr