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 10, 2023 09:21matsuoka-601matsuoka-601Score: 12,305Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2023 09:2112,205123,016,39999,293,0002,005,0002,265,088
2Nov 10, 2023 09:2112,205127,301,47899,297,0002,006,0002,269,184
3Nov 10, 2023 09:2112,210127,065,02199,339,0002,006,0002,285,568
4Nov 10, 2023 09:2112,215127,138,674101,382,00002,285,568
5Nov 10, 2023 09:2112,231125,939,388100,511,0001,005,0002,285,568
6Nov 10, 2023 09:2112,265127,715,27799,800,0001,996,0002,285,568
7Nov 10, 2023 09:2112,305127,489,681101,133,0001,001,0002,265,088
8Nov 10, 2023 09:2112,310128,053,041100,169,0002,003,0002,285,568
9Nov 10, 2023 09:2112,748128,510,531103,814,0001,996,0002,285,568
10Nov 10, 2023 09:2114,208178,158,715117,928,37302,281,472
11Nov 10, 2023 09:2114,233182,679,001118,130,59402,285,568
12Nov 10, 2023 09:2114,545187,827,667120,723,96602,277,376