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 14, 2024 03:06zielajzielajScore: 5,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 03:064,92462,538,81839,874,000996,0002,514,944
2Nov 14, 2024 03:064,99268,546,37740,422,0001,010,0002,371,584
3Nov 14, 2024 03:065,05666,024,97639,964,0001,998,0002,363,392
4Nov 14, 2024 03:065,88271,196,99947,821,000996,0002,527,232
5Nov 14, 2024 03:065,89472,771,58547,923,000998,0002,383,872
6Nov 14, 2024 03:066,02969,252,63948,041,0002,001,0002,265,088