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 19, 2026 08:04wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:42Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:42038,757,63729,490,0001,047,0002,113,536expected "74600294196621100 ", got "74924966357434028 "
2Jul 6, 2026 17:42036,662,80027,664,0001,031,0002,113,536expected "74600294196621100 ", got "74924987248147928 "
3Jul 6, 2026 17:42039,946,75031,031,0001,002,0002,113,536expected "74600294196621100 ", got "74594479279242477 "
4Apr 19, 2026 08:053,68557,127,95629,569,0001,019,0002,486,272
5Apr 19, 2026 08:053,69255,260,17529,625,0001,021,0002,494,464
6Apr 19, 2026 08:043,71653,580,37129,848,000994,0002,498,560
7Apr 19, 2026 08:043,72060,137,29528,888,0001,992,0002,277,376
8Apr 19, 2026 08:053,83150,828,26429,811,0001,987,0002,498,560
9Apr 19, 2026 08:043,83560,526,44229,845,0001,989,0002,502,656