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 listNov 27, 2024 02:03Joad NacerJoad NacerScore: 4,941Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 27, 2024 02:034,90164,206,89940,678,00002,301,952
2Nov 27, 2024 02:034,91769,325,19538,819,0001,990,0002,301,952
3Nov 27, 2024 02:034,93662,781,55238,968,0001,998,0002,392,064
4Nov 27, 2024 02:034,94169,472,05838,007,0003,000,0002,273,280
5Nov 27, 2024 02:034,94672,659,84140,054,0001,001,0002,301,952
6Nov 27, 2024 02:034,96765,221,82239,218,0002,011,0002,310,144