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 listOct 8, 2024 14:42matsuoka-601matsuoka-601Error
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:31Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:31045,887,14334,627,0001,018,0002,117,632expected "74600294196621100 ", got "47987727860935679"stderr
2Jul 6, 2026 20:310112,457,743101,477,0001,049,00020,480No answer to stdout. Died or killed?stderr
3Oct 8, 2024 14:424,13257,574,75231,268,0003,025,0002,301,952
4Oct 8, 2024 14:424,13962,846,92133,346,0001,010,0002,519,040
5Oct 8, 2024 14:424,15761,777,60932,471,0002,029,0002,510,848