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:39Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:56Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 02:56047,706,15836,389,0001,020,0002,113,536expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 02:56047,587,06136,280,0001,020,0002,113,536expected "74600294196621100 ", got "17101192389373740 "
3Jul 7, 2026 02:56046,399,21435,630,0001,018,0002,113,536expected "74600294196621100 ", got "15382837741203244 "
4Apr 20, 2026 13:404,62158,206,00736,338,0002,018,0002,281,472
5Apr 20, 2026 13:404,63462,851,36736,441,0002,024,0002,265,088
6Apr 20, 2026 13:404,65368,572,73636,595,0002,033,0002,285,568