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 13, 2026 18:46Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:29Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:29054,401,97845,322,0001,195,0002,117,632expected "74600294196621100 ", got "17327655678029612 "
2Jul 7, 2026 05:29061,631,12945,526,0001,175,0002,117,632expected "74600294196621100 ", got "17327655678029612 "
3Jul 7, 2026 05:29063,298,72846,074,0001,231,0002,117,632expected "74600294196621100 ", got "15414004478029612 "
4Apr 13, 2026 18:465,68971,717,35845,206,0002,009,0002,273,280
5Apr 13, 2026 18:465,70772,467,19145,355,0002,015,0002,535,424
6Apr 13, 2026 18:465,73572,589,74446,591,0001,012,0002,535,424