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:28Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 00:13Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 00:13042,590,70533,370,0001,120,0002,117,632expected "74600294196621100 ", got "20553046321946813 "
2Jul 7, 2026 00:13042,465,91033,479,0001,138,0002,117,632expected "74600294196621100 ", got "20553046321446944 "
3Jul 7, 2026 00:13042,847,81433,623,0001,128,0002,117,632expected "74600294196621100 ", got "20553177393966892 "
4Apr 13, 2026 18:284,34766,287,76234,080,0002,004,0002,535,424
5Apr 13, 2026 18:284,35064,755,58134,099,0002,005,0002,478,080
6Apr 13, 2026 18:284,35368,293,55334,121,0002,007,0002,469,888