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 20, 2026 12:02wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:02Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:02037,739,98128,880,0001,029,0002,113,536expected "74600294196621100 ", got "74526904723476377 "
2Jul 6, 2026 17:02035,445,71026,536,0001,036,0002,113,536expected "74600294196621100 ", got "74924954770398118 "
3Jul 6, 2026 17:02036,028,43927,082,0001,018,0002,113,536expected "74600294196621100 ", got "74924801632532918 "
4Apr 20, 2026 12:033,54951,400,28928,443,0001,015,0002,469,888
5Apr 20, 2026 12:033,55252,221,80028,466,0001,016,0002,469,888
6Apr 20, 2026 12:033,62142,205,20628,055,0002,003,0002,269,184