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 listMay 24, 2021 19:25Yuriy LyfenkoYuriy LyfenkoScore: 17,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 19:2517,209169,005,221141,836,000998,0002,260,992
2May 24, 2021 19:2517,209167,991,937140,836,0001,997,0002,260,992
3May 24, 2021 19:2517,217173,384,988140,899,0001,998,0002,260,992
4May 24, 2021 19:2517,224166,232,323140,959,0001,999,0002,523,136
5May 24, 2021 19:2517,235169,809,303141,048,0002,000,0002,392,064
6May 24, 2021 19:2517,349178,862,541141,994,0001,999,0002,523,136
7May 24, 2021 19:2517,561174,111,962144,759,000998,0002,260,992
8May 24, 2021 19:2517,593170,759,102146,021,00002,502,656
9May 24, 2021 19:2517,594215,195,943146,026,74602,256,896
10May 24, 2021 19:2517,613174,777,664144,189,0002,002,0002,375,680
11May 24, 2021 19:2518,286203,597,974151,772,26902,269,184
12May 24, 2021 19:2518,309199,837,525151,968,45702,269,184