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 10, 2024 12:22Joad NacerJoad NacerScore: 8,150Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 10, 2024 12:227,12885,702,86158,162,0001,002,0002,273,280
2Oct 10, 2024 12:227,13883,218,27157,239,0002,008,0002,535,424
3Oct 10, 2024 12:227,13986,637,97357,249,0002,008,0002,420,736
4Oct 10, 2024 12:228,15095,959,55567,643,00002,269,184
5Oct 10, 2024 12:228,17989,184,29766,884,000998,0002,531,328
6Oct 10, 2024 12:228,21885,709,09266,200,0002,006,0002,531,328