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 27, 2026 02:54Victor MerckléVictor MerckléScore: 10,986Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 02:5510,82498,147,46088,650,0001,196,0002,117,632stderr
2Aug 27, 2026 02:5510,89098,561,15589,296,0001,095,0002,117,632stderr
3Aug 27, 2026 02:5510,92098,801,97589,479,0001,163,0002,117,632stderr
4Aug 27, 2026 02:5510,93699,143,44989,671,0001,106,0002,117,632stderr
5Aug 27, 2026 02:5510,986100,292,41090,040,0001,151,0002,117,632stderr
6Aug 27, 2026 02:5511,221111,766,08291,969,0001,169,0002,117,632stderr
7Aug 27, 2026 02:5511,222101,563,90692,026,0001,122,0002,117,632stderr
8Aug 27, 2026 02:5511,252101,683,75192,288,0001,107,0002,117,632stderr
9Aug 27, 2026 02:5511,743114,233,47296,367,0001,102,0002,117,632stderr