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:26wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:15Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:16041,529,77532,286,0001,178,0002,113,536expected "74600294196621100 ", got "73845380558016300 "
2Jul 6, 2026 22:16043,720,69534,442,0001,170,0002,113,536expected "74600294196621100 ", got "74222294989537580 "
3Jul 6, 2026 22:16043,583,49334,229,0001,181,0002,113,536expected "74600294196621100 ", got "74222028944711980 "
4Apr 11, 2026 13:264,23963,465,44133,171,0002,010,0002,498,560
5Apr 11, 2026 13:264,25359,657,90934,295,0001,008,0002,494,464
6Apr 11, 2026 13:264,25960,160,05134,340,0001,010,0002,277,376