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 listMar 25, 2024 19:18Alexander KrivolapovAlexander KrivolapovScore: 20,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2024 19:1819,658225,762,121163,161,88502,351,104
2Mar 25, 2024 19:1819,736222,230,872163,809,62902,347,008
3Mar 25, 2024 19:1819,746227,784,233163,888,01502,355,200
4Mar 25, 2024 19:1819,804193,293,571162,366,0002,004,0002,482,176
5Mar 25, 2024 19:1819,887192,679,659162,062,0003,001,0002,473,984
6Mar 25, 2024 19:1819,924191,104,704164,366,0001,002,0002,519,040
7Mar 25, 2024 19:1820,030191,387,404164,246,0002,003,0002,519,040
8Mar 25, 2024 19:1820,085196,363,934164,710,0001,996,0002,473,984
9Mar 25, 2024 19:1820,105194,666,586165,873,000999,0002,478,080
10Mar 25, 2024 19:1820,118196,394,193164,978,0001,999,0002,469,888
11Mar 25, 2024 19:1820,160196,122,023164,323,0003,005,0002,469,888
12Mar 25, 2024 19:1820,208191,579,284166,732,000998,0002,519,040