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 17, 2026 16:11Mikołaj UzarskiMikołaj UzarskiError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 03:58Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:58051,068,10940,143,0001,289,0002,113,536expected "74600294196621100 ", got "74617420660137485 "
2Jul 7, 2026 03:585,01552,952,67140,611,0001,020,0002,113,536
3Jul 7, 2026 03:585,02351,508,59640,411,0001,286,0002,113,536
4Mar 17, 2026 16:115,10565,860,57540,356,0002,017,0002,506,752
5Mar 17, 2026 16:115,11265,550,79140,408,0002,020,0002,277,376
6Mar 17, 2026 16:115,12565,141,86941,527,0001,012,0002,285,568