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 19, 2026 23:10olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:30Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:30045,966,83035,459,0001,022,0002,113,536expected "74600294196621100 ", got "47749944239519532 "
2Jul 7, 2026 05:30047,664,78336,901,0001,295,0002,113,536expected "74600294196621100 ", got "36670326778555436 "
3Jul 7, 2026 05:30048,292,45037,802,0001,023,0002,113,536expected "74600294196621100 ", got "46977343389415468 "
4Mar 19, 2026 23:105,66371,402,84243,004,0004,000,0002,342,912
5Mar 19, 2026 23:105,71076,086,40043,363,0004,033,0002,334,720
6Mar 19, 2026 23:105,74173,869,72346,639,0001,013,0002,482,176