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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 04:22Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:23050,425,42941,302,0001,032,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 04:23050,683,34641,505,0001,024,0002,117,632expected "74600294196621100 ", got "15368420549373740 "
3Jul 7, 2026 04:23049,980,07540,896,0001,024,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 13, 2026 19:205,19263,563,38642,095,0001,002,0002,310,144
5Apr 13, 2026 19:205,21367,284,87241,258,0002,012,0002,273,280
6Apr 13, 2026 19:205,28170,701,61141,841,0001,992,0002,310,144