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 20, 2026 23:33Andrew EpsteinAndrew EpsteinScore: 6,019Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 20, 2026 23:335,96959,361,06348,437,0001,110,0002,113,536
2Aug 20, 2026 23:335,97759,421,70148,473,0001,138,0002,113,536
3Aug 20, 2026 23:335,98359,524,69048,548,0001,116,0002,113,536
4Aug 20, 2026 23:336,01959,750,28648,833,0001,126,0002,113,536
5Aug 20, 2026 23:336,01960,845,29748,831,0001,133,0002,113,536
6Aug 20, 2026 23:336,08560,220,98949,383,0001,128,0002,113,536
7Aug 20, 2026 23:336,09060,387,57649,427,0001,126,0002,113,536
8Aug 20, 2026 23:336,11760,503,40349,643,0001,134,0002,113,536
9Aug 20, 2026 23:336,12460,589,25849,696,0001,134,0002,113,536