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 listApr 14, 2026 10:39wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:10Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:10037,375,34128,120,0001,128,0002,113,536expected "74600294196621100 ", got "72367338849942828 "
2Jul 6, 2026 20:10038,214,57729,021,0001,112,0002,113,536expected "74600294196621100 ", got "72496765328121132 "
3Jul 6, 2026 20:10037,450,36828,183,0001,106,0002,113,536expected "74600294196621100 ", got "72986118788359212 "
4Apr 14, 2026 10:394,03353,346,59032,462,0001,014,0002,494,464
5Apr 14, 2026 10:384,05356,094,82332,622,0001,019,0002,502,656
6Apr 14, 2026 10:384,07559,933,35831,837,0001,989,0002,531,328
7Apr 14, 2026 10:394,10458,737,09132,062,0002,003,0002,486,272
8Apr 14, 2026 10:394,16059,497,65633,512,0001,015,0002,490,368
9Apr 14, 2026 10:384,21460,109,94532,979,0001,998,0002,486,272