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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:25Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:25047,287,04834,386,0004,987,00020,480expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 01:25045,384,16334,079,0003,288,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
3Jul 7, 2026 01:25046,964,84434,347,0003,978,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 19:514,37764,385,47235,322,0001,009,0002,535,424
5Apr 13, 2026 19:514,39057,911,91535,427,0001,012,0002,535,424
6Apr 13, 2026 19:514,41764,584,92536,665,00002,478,080