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 06:44Victor MerckléVictor MerckléScore: 3,796Success
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 06:453,74939,420,50529,988,0001,130,0002,113,536
2Aug 27, 2026 06:453,75039,468,80129,985,0001,142,0002,113,536
3Aug 27, 2026 06:453,77039,598,16830,201,0001,090,0002,113,536
4Aug 27, 2026 06:453,78139,841,78830,151,0001,235,0002,113,536
5Aug 27, 2026 06:453,79639,914,29730,383,0001,131,0002,113,536
6Aug 27, 2026 06:453,87440,522,98731,052,0001,104,0002,113,536
7Aug 27, 2026 06:453,93641,034,18031,581,0001,089,0002,113,536
8Aug 27, 2026 06:453,96941,853,22231,888,0001,062,0002,113,536
9Aug 27, 2026 06:454,02241,811,01332,259,0001,130,0002,113,536