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 listMar 21, 2026 07:16olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:40Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:40048,554,06236,905,0002,003,0002,117,632expected "74600294196621100 ", got "47060015721846060 "
2Jul 7, 2026 05:40048,112,28737,236,0001,031,0002,117,632expected "74600294196621100 ", got "36708427712235564 "
3Jul 7, 2026 05:40048,354,06137,735,0001,027,0002,117,632expected "74600294196621100 ", got "47050036767441964 "
4Mar 21, 2026 07:165,66673,277,63544,025,0003,001,0002,445,312
5Mar 21, 2026 07:165,76176,153,71647,813,00002,437,120
6Mar 21, 2026 07:165,95570,196,05644,385,0005,043,0002,424,832