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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:40045,505,56134,732,0001,222,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 01:40043,961,62134,985,0001,033,0002,117,632expected "74600294196621100 ", got "15382962259603244 "
3Jul 7, 2026 01:40043,079,56934,169,0001,020,00020,480expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 18:344,43766,521,56835,830,000995,0002,482,176
5Apr 13, 2026 18:344,44263,106,83135,870,000996,0002,469,888
6Apr 13, 2026 18:344,45261,916,51434,955,0001,997,0002,473,984