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 listMar 14, 2026 18:55wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:06Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:07041,924,12032,640,0001,172,0002,113,536expected "74600294196621100 ", got "73737707396080940 "
2Jul 6, 2026 23:07042,006,29832,877,0001,013,0002,113,536expected "74600294196621100 ", got "73738887804039980 "
3Jul 6, 2026 23:07051,480,52033,355,0001,018,0002,113,536expected "74600294196621100 ", got "73738406568937260 "
4Mar 14, 2026 18:554,27760,788,62334,481,0001,014,0002,490,368
5Mar 14, 2026 18:554,27858,391,84134,497,0001,014,0002,494,464
6Mar 14, 2026 18:554,31767,083,50934,835,000995,0002,273,280