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:38wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:54Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:54044,504,08233,781,0001,018,0002,113,536expected "74600294196621100 ", got "74594349389208487 "
2Jul 6, 2026 20:54042,725,64031,934,0001,152,0002,113,536expected "74600294196621100 ", got "74924883314425128 "
3Jul 6, 2026 20:54042,695,27631,907,0001,163,0002,113,536expected "74600294196621100 ", got "74924825639952928 "
4Apr 19, 2026 09:384,16758,833,77033,572,0001,017,0002,293,760
5Apr 19, 2026 09:384,17256,519,45833,606,0001,018,0002,265,088
6Apr 19, 2026 09:384,19863,396,39733,846,000995,0002,273,280