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 11, 2024 16:20Joad NacerJoad NacerScore: 4,796Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 11, 2024 16:204,71660,673,59036,135,0003,011,0002,285,568
2Oct 11, 2024 16:204,71861,104,04936,151,0003,012,0002,351,104
3Oct 11, 2024 16:204,72065,894,64237,164,0002,008,0002,351,104
4Oct 11, 2024 16:204,79666,665,81336,824,0002,985,0002,383,872
5Oct 11, 2024 16:204,79762,921,99337,825,0001,990,0002,351,104
6Oct 11, 2024 16:204,79768,810,24436,827,0002,986,0002,351,104