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 20, 2026 13:38Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:41Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 02:41047,792,46335,688,0001,017,0002,113,536expected "74600294196621100 ", got "15382969541373740 "
2Jul 7, 2026 02:41046,229,98335,562,0001,017,0002,113,536expected "74600294196621100 ", got "17101192389373740 "
3Jul 7, 2026 02:41046,283,31335,586,0001,017,0002,113,536expected "74600294196621100 ", got "17101192389373740 "
4Apr 20, 2026 13:384,59661,293,26435,141,0003,012,0002,260,992
5Apr 20, 2026 13:384,60562,623,08735,207,0003,017,0002,265,088
6Apr 20, 2026 13:384,61162,780,04235,251,0003,021,0002,273,280