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 12, 2026 19:51Mikołaj UzarskiMikołaj UzarskiError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 04:11Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:11050,966,07840,254,0001,023,0002,117,632expected "74600294196621100 ", got "74600657249061535 "stderr
2Jul 7, 2026 04:115,00151,204,87140,492,0001,019,0002,117,632stderr
3Jul 7, 2026 04:115,01751,334,76240,628,0001,016,0002,117,632stderr
4Mar 12, 2026 19:515,10568,154,65240,354,0002,017,0002,289,664
5Mar 12, 2026 19:515,12265,302,33142,513,00002,510,848
6Mar 12, 2026 19:515,12564,569,57141,528,0001,012,0002,289,664