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 19, 2026 09:42wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:09Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:09045,530,59034,702,0001,193,0002,113,536expected "74600294196621100 ", got "74594488276860467 "
2Jul 6, 2026 21:09042,386,45331,675,0001,129,0002,113,536expected "74600294196621100 ", got "74924890773808918 "
3Jul 6, 2026 21:09042,608,36331,694,0001,188,0002,113,536expected "74600294196621100 ", got "74924923713844018 "
4Apr 19, 2026 09:424,18264,430,08733,691,0001,020,0002,293,760
5Apr 19, 2026 09:424,20057,896,63633,836,0001,025,0002,293,760
6Apr 19, 2026 09:424,36864,725,87134,241,0002,014,0002,273,280