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 19, 2026 04:39Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 01:26Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 01:26043,116,65433,995,0001,054,00020,480expected "74600294196621100 ", got "17101192389373740 "
2Jul 7, 2026 01:26043,766,48734,410,0001,304,00020,480expected "74600294196621100 ", got "15382962259603244 "
3Jul 7, 2026 01:26043,349,91734,238,0001,063,00020,480expected "74600294196621100 ", got "15180987589373740 "
4Apr 19, 2026 04:394,38558,556,22135,382,0001,010,0002,269,184
5Apr 19, 2026 04:394,39257,138,91835,442,0001,012,0002,482,176
6Apr 19, 2026 04:394,40061,072,32035,506,0001,014,0002,473,984