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 03:57Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 03:58048,464,89539,354,0001,070,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 03:58048,383,45639,334,0001,030,0002,117,632expected "74600294196621100 ", got "17101192389373740 "
3Jul 7, 2026 03:58048,426,64239,292,0001,028,0002,117,632expected "74600294196621100 ", got "15382837741203244 "
4Apr 19, 2026 05:145,06664,108,71140,045,0002,002,0002,535,424
5Apr 19, 2026 05:145,10571,599,22141,364,0001,008,0002,310,144
6Apr 19, 2026 05:145,16267,420,75540,854,0001,992,0002,269,184