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:15olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:38Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:38050,085,51939,324,0001,032,0002,117,632expected "74600294196621100 ", got "36691445750845484 "
2Jul 7, 2026 05:38050,488,47539,860,0001,028,0002,117,632expected "74600294196621100 ", got "36687496578464044 "
3Jul 7, 2026 05:38050,635,68138,959,0002,028,0002,117,632expected "74600294196621100 ", got "47750196548049196 "
4Mar 21, 2026 07:155,66271,437,26943,994,0002,999,0002,506,752
5Mar 21, 2026 07:155,75875,984,88544,808,0002,987,0002,379,776
6Mar 21, 2026 07:155,83374,276,12044,381,0004,034,0002,383,872