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 14, 2026 08:39wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 18:48Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:48039,999,16830,936,0001,076,0002,113,536expected "74600294196621100 ", got "74099174826963756 "
2Jul 6, 2026 18:48037,226,12428,322,0001,011,0002,113,536expected "74600294196621100 ", got "72983522445254444 "
3Jul 6, 2026 18:48041,225,58732,192,0001,082,0002,113,536expected "74600294196621100 ", got "74097674417714476 "
4Apr 14, 2026 08:394,04051,786,50732,518,0001,016,0002,498,560
5Apr 14, 2026 08:394,07761,248,24131,851,0001,990,0002,482,176
6Apr 14, 2026 08:394,19368,364,80332,817,0001,988,0002,494,464