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 18:37Victor MerckléVictor MerckléScore: 3,775Success
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 18:383,74339,451,45129,925,0001,144,0002,117,632stderr
2Aug 24, 2026 18:383,75040,227,63030,011,0001,120,0002,117,632stderr
3Aug 24, 2026 18:383,75739,646,56130,054,0001,134,0002,117,632stderr
4Aug 24, 2026 18:383,76339,630,48330,128,0001,111,0002,117,632stderr
5Aug 24, 2026 18:383,77539,719,17030,257,0001,079,0002,117,632stderr
6Aug 24, 2026 18:383,78139,745,40030,262,0001,127,0002,117,632stderr
7Aug 24, 2026 18:383,78739,852,58530,324,0001,112,0002,117,632stderr
8Aug 24, 2026 18:383,79039,847,62030,373,0001,092,0002,117,632stderr
9Aug 24, 2026 18:383,91340,870,47431,394,0001,086,0002,117,632stderr