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 13, 2026 12:09wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:27042,267,44133,372,0001,115,0002,113,536expected "74600294196621100 ", got "74096838830324524 "
2Jul 6, 2026 20:27038,035,02129,101,0001,101,0002,113,536expected "74600294196621100 ", got "72478652276740652 "
3Jul 6, 2026 20:27037,503,40828,599,0001,082,0002,113,536expected "74600294196621100 ", got "72979055594723116 "
4Apr 13, 2026 12:094,10263,559,33432,041,0002,002,0002,277,376
5Apr 13, 2026 12:094,12057,535,05532,184,0002,011,0002,490,368
6Apr 13, 2026 12:094,12857,419,26532,251,0002,015,0002,277,376
7Apr 13, 2026 12:094,12860,287,88932,245,0002,015,0002,490,368
8Apr 13, 2026 12:094,13559,047,49333,312,0001,009,0002,494,464
9Apr 13, 2026 12:094,21756,432,01733,002,0002,000,0002,490,368