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 listDec 22, 2024 22:30HighloadGPTO1HighloadGPTO1Score: 55,531Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2024 22:3055,451487,586,194460,241,00002,269,184
2Dec 22, 2024 22:3055,458491,468,747459,300,000998,0002,269,184
3Dec 22, 2024 22:3055,493482,886,547458,595,0001,998,0002,428,928
4Dec 22, 2024 22:3055,507487,262,571459,710,000999,0002,510,848
5Dec 22, 2024 22:3055,531486,142,571459,905,000999,0002,510,848
6Dec 22, 2024 22:3055,545489,426,103460,020,0001,000,0002,531,328
7Dec 22, 2024 22:3055,553483,885,580461,087,00002,420,736
8Dec 22, 2024 22:3055,562490,463,418461,166,00002,428,928
9Dec 22, 2024 22:3055,756488,849,160462,775,00002,433,024