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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:12Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:12053,692,05642,245,0001,016,0002,113,536expected "74600294196621100 ", got "8731517020253996 "
2Jul 7, 2026 05:12052,870,54142,099,0001,014,0002,113,536expected "74600294196621100 ", got "8731517020253996 "
3Jul 7, 2026 05:12053,261,43142,579,0001,015,0002,113,536expected "74600294196621100 ", got "6760849500253996 "
4Mar 18, 2026 02:465,60169,063,54143,458,0003,031,0002,285,568
5Mar 18, 2026 02:465,61776,508,20145,607,0001,013,0002,297,856
6Mar 18, 2026 02:465,68071,507,57646,143,0001,003,0002,306,048