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 19, 2026 05:14Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:44Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:44044,168,46034,932,0001,103,0002,117,632expected "74600294196621100 ", got "15382838469373740 "
2Jul 7, 2026 01:44044,024,71334,972,0001,136,0002,117,632expected "74600294196621100 ", got "15382962259603244 "
3Jul 7, 2026 01:44044,098,15134,991,0001,214,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
4Apr 19, 2026 05:144,43864,180,06435,840,000995,0002,535,424
5Apr 19, 2026 05:144,45661,390,54634,984,0001,999,0002,301,952
6Apr 19, 2026 05:144,48556,924,06235,217,0002,012,0002,535,424