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 17, 2021 20:19Yuriy LyfenkoYuriy LyfenkoScore: 17,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 17, 2021 20:1917,487641,629,452145,142,00002,260,992
2May 17, 2021 20:1917,491348,807,815142,196,0002,983,0002,527,232
3May 17, 2021 20:1917,4941,543,123,652144,206,000994,0002,265,088
4May 17, 2021 20:1917,5031,533,041,909143,282,0001,990,0002,519,040
5May 17, 2021 20:1917,5051,275,757,356143,291,0002,004,0002,260,992
6May 17, 2021 20:1917,5112,599,619,630144,337,0001,002,0002,519,040
7May 17, 2021 20:1917,5112,301,793,317144,341,0001,002,0002,519,040
8May 17, 2021 20:1917,5141,044,816,441143,373,0001,991,0002,519,040
9May 17, 2021 20:1917,5161,695,809,779144,386,000995,0002,265,088