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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:27037,203,05328,371,0001,009,0002,113,536expected "74600294196621100 ", got "74594633000217367 "
2Jul 6, 2026 17:27035,799,98926,884,0001,002,0002,113,536expected "74600294196621100 ", got "74924979777588988 "
3Jul 6, 2026 17:27036,622,75827,678,0001,043,0002,113,536expected "74600294196621100 ", got "74534913542641900 "
4Apr 20, 2026 12:223,59456,685,78027,846,0001,989,0002,461,696
5Apr 20, 2026 12:223,59656,444,47428,857,000995,0002,465,792
6Apr 20, 2026 12:223,63150,144,68628,136,0002,009,0002,461,696