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 23, 2026 19:37Victor MerckléVictor MerckléScore: 3,778Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 19:383,72540,015,53729,811,0001,107,0002,117,632stderr
2Aug 23, 2026 19:383,74639,495,31029,917,0001,180,0002,117,632stderr
3Aug 23, 2026 19:383,75439,541,79130,050,0001,112,0002,117,632stderr
4Aug 23, 2026 19:383,75940,238,20630,083,0001,118,0002,117,632stderr
5Aug 23, 2026 19:383,77839,772,69930,193,0001,169,0002,117,632stderr
6Aug 23, 2026 19:383,78039,812,46830,260,0001,122,0002,117,632stderr
7Aug 23, 2026 19:383,79440,559,48830,340,0001,154,0002,117,632stderr
8Aug 23, 2026 19:383,94641,128,44831,738,0001,015,0002,117,632stderr
9Aug 23, 2026 19:383,95341,207,44431,664,0001,151,0002,117,632stderr