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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:46Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:46046,142,91135,229,0001,164,0002,113,536expected "74600294196621100 ", got "74527509298966850 "
2Jul 6, 2026 22:46043,044,41832,250,0001,151,0002,113,536expected "74600294196621100 ", got "74923802812972108 "
3Jul 6, 2026 22:46042,623,40631,803,0001,148,0002,113,536expected "74600294196621100 ", got "74924904973117998 "
4Apr 19, 2026 09:394,19460,308,43132,821,0001,989,0002,269,184
5Apr 19, 2026 09:394,26364,171,78434,370,0001,010,0002,293,760
6Apr 19, 2026 09:394,35658,775,50634,147,0002,008,0002,293,760