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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:53Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:53044,308,90335,091,0001,220,0002,117,632expected "74600294196621100 ", got "17327655678029612 "
2Jul 7, 2026 01:53044,018,36235,107,0001,090,0002,117,632expected "74600294196621100 ", got "15615854629859116 "
3Jul 7, 2026 01:53043,790,27934,819,0001,098,0002,117,632expected "74600294196621100 ", got "15615854629859116 "
4Apr 13, 2026 18:464,49664,876,83135,299,0002,017,0002,465,792
5Apr 13, 2026 18:464,50065,995,79036,340,0001,009,0002,535,424
6Apr 13, 2026 18:464,52764,337,60136,555,0001,015,0002,293,760