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 28, 2026 02:12olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:27Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:27047,963,85135,739,0002,035,0002,117,632expected "74600294196621100 ", got "53553096160188716 "
2Jul 7, 2026 05:27048,237,60136,073,0002,021,0002,117,632expected "74600294196621100 ", got "53518254639692588 "
3Jul 7, 2026 05:27047,975,80535,634,0002,141,0002,117,632expected "74600294196621100 ", got "53559042368983084 "
4Mar 28, 2026 02:075,66073,720,70142,983,0003,998,0002,502,656
5Mar 28, 2026 02:075,66470,353,02645,015,0002,000,0002,514,944
6Mar 28, 2026 02:125,67372,153,67441,073,0006,010,0002,510,848
7Mar 28, 2026 02:125,67770,285,89642,105,0005,012,0002,465,792
8Mar 28, 2026 02:075,84377,369,64342,437,0006,062,0002,367,488
9Mar 28, 2026 02:125,87878,798,48445,804,0002,987,0002,469,888