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

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:16Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:17046,209,55935,647,0001,026,0002,117,632expected "74600294196621100 ", got "36642423810768172 "
2Jul 7, 2026 05:17046,278,18535,678,0001,024,0002,117,632expected "74600294196621100 ", got "53515241992951084 "
3Jul 7, 2026 05:17046,416,37935,785,0001,027,0002,117,632expected "74600294196621100 ", got "53515271381567532 "
4Mar 21, 2026 07:215,63973,112,96345,812,000995,0002,453,504
5Mar 21, 2026 07:215,64670,471,98043,874,0002,991,0002,519,040
6Mar 21, 2026 07:215,74873,487,01343,733,0003,975,0002,449,408