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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:50044,210,61734,995,0001,117,0002,117,632expected "74600294196621100 ", got "15157030540717868 "
2Jul 7, 2026 01:50043,681,63234,726,0001,104,0002,117,632expected "74600294196621100 ", got "16881282700717868 "
3Jul 7, 2026 01:50044,071,08635,054,0001,101,0002,117,632expected "74600294196621100 ", got "15157030540717868 "
4Apr 13, 2026 18:294,47362,542,49135,118,0002,006,0002,535,424
5Apr 13, 2026 18:294,48066,457,84035,174,0002,009,0002,473,984
6Apr 13, 2026 18:294,49158,658,67637,276,00002,478,080