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 listDec 29, 2022 22:55Alexander KimAlexander KimScore: 27,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2022 22:5527,319254,379,010226,747,00002,326,528
2Dec 29, 2022 22:5527,322251,152,664225,772,000998,0002,326,528
3Dec 29, 2022 22:5527,328253,033,016223,829,0002,997,0002,428,928
4Dec 29, 2022 22:5527,330259,281,027224,841,0001,998,0002,322,432
5Dec 29, 2022 22:5527,351251,808,595223,010,0004,000,0002,326,528
6Dec 29, 2022 22:5527,361284,321,656227,094,06102,293,760
7Dec 29, 2022 22:5527,367300,908,459227,145,31902,285,568
8Dec 29, 2022 22:5527,371252,468,136224,176,0003,002,0002,469,888
9Dec 29, 2022 22:5527,377297,306,838227,230,27202,289,664
10Dec 29, 2022 22:5527,384250,386,064224,287,0003,003,0002,519,040
11Dec 29, 2022 22:5527,388252,122,303224,320,0003,004,0002,326,528
12Dec 29, 2022 22:5527,391248,954,951224,342,0003,004,0002,326,528