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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 04:52Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:52052,837,14042,113,0001,017,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
2Jul 7, 2026 04:52053,317,27942,494,0001,142,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
3Jul 7, 2026 04:52053,069,46141,870,0001,018,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
4Mar 18, 2026 03:115,25570,464,78142,599,0001,014,0002,285,568
5Mar 18, 2026 03:115,37980,451,72744,648,00002,285,568
6Mar 18, 2026 03:115,42771,305,19842,043,0003,003,0002,285,568