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 11, 2026 13:32wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:37Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:37040,809,84631,590,0001,110,0002,113,536expected "74600294196621100 ", got "73834194542948140 "
2Jul 6, 2026 21:37042,375,91233,198,0001,076,0002,113,536expected "74600294196621100 ", got "73845812002870060 "
3Jul 6, 2026 21:37043,245,05734,049,0001,071,0002,113,536expected "74600294196621100 ", got "74222782886190380 "
4Apr 11, 2026 13:324,22455,641,35633,053,0002,003,0002,494,464
5Apr 11, 2026 13:324,22457,780,28333,054,0002,003,0002,502,656
6Apr 11, 2026 13:324,22757,020,50933,077,0002,004,0002,490,368
7Apr 11, 2026 13:324,23658,871,19833,148,0002,008,0002,498,560
8Apr 11, 2026 13:324,23961,826,53533,171,0002,010,0002,531,328
9Apr 11, 2026 13:324,24562,475,26333,223,0002,013,0002,277,376