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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:20Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:20047,062,05135,380,0002,033,0002,117,632expected "74600294196621100 ", got "53559449485902636 "
2Jul 7, 2026 05:20046,658,05236,064,0001,032,0002,117,632expected "74600294196621100 ", got "36630075221315628 "
3Jul 7, 2026 05:20049,691,64137,991,0002,059,0002,117,632expected "74600294196621100 ", got "35709481731788844 "
4Mar 21, 2026 07:225,62072,793,42341,574,0005,070,0002,383,872
5Mar 21, 2026 07:225,64869,285,01845,882,000997,0002,437,120
6Mar 21, 2026 07:225,66273,484,65044,994,0001,999,0002,486,272