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 14:01Joad NacerJoad NacerScore: 4,552Success
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 14:014,48159,951,51535,183,0002,010,0002,351,104
2Oct 11, 2024 14:014,48761,430,64035,230,0002,013,0002,351,104
3Oct 11, 2024 14:014,49357,558,91435,277,0002,015,0002,387,968
4Oct 11, 2024 14:014,55264,206,13135,797,0001,988,0002,351,104
5Oct 11, 2024 14:014,55665,525,19835,821,0001,990,0002,301,952
6Oct 11, 2024 14:014,56060,069,25234,857,0002,987,0002,383,872