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 23:38Victor MerckléVictor MerckléScore: 3,946Success
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 23:393,92741,071,34131,541,0001,055,0002,117,632stderr
2Aug 24, 2026 23:393,93341,080,73831,588,0001,059,0002,117,632stderr
3Aug 24, 2026 23:393,94041,105,92531,682,0001,025,0002,117,632stderr
4Aug 24, 2026 23:393,94141,197,70831,617,0001,100,0002,117,632stderr
5Aug 24, 2026 23:393,94641,113,84631,739,0001,014,0002,117,632stderr
6Aug 24, 2026 23:393,95441,220,20831,808,0001,011,0002,117,632stderr
7Aug 24, 2026 23:393,96341,283,32231,883,0001,012,0002,117,632stderr
8Aug 24, 2026 23:393,96641,353,87431,909,0001,017,0002,117,632stderr
9Aug 24, 2026 23:393,96841,599,43331,904,0001,036,0002,117,632stderr