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 20, 2026 00:08olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:50Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:50049,181,77537,556,0002,036,0002,117,632expected "74600294196621100 ", got "55805151288145196 "
2Jul 7, 2026 05:50049,262,14938,243,0001,025,0002,117,632expected "74600294196621100 ", got "67206617971319084 "
3Jul 7, 2026 05:50051,484,27038,950,0001,028,0002,117,632expected "74600294196621100 ", got "67298449567377708 "
4Mar 20, 2026 00:085,76179,508,43445,824,0001,992,0002,482,176
5Mar 20, 2026 00:085,79769,608,75446,111,0002,004,0002,498,560
6Mar 20, 2026 00:085,80576,300,95346,178,0002,007,0002,416,640