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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 23:52Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 23:53042,089,13132,874,0001,106,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
2Jul 6, 2026 23:53041,919,48732,940,0001,134,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
3Jul 6, 2026 23:53042,108,31433,073,0001,149,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 18:554,28366,198,55834,535,0001,015,0002,465,792
5Apr 13, 2026 18:554,31659,454,65434,828,000995,0002,535,424
6Apr 13, 2026 18:554,31864,628,57434,843,000995,0002,473,984