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 5, 2021 21:54Yuriy LyfenkoYuriy LyfenkoScore: 19,943Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2021 21:5419,931191,491,199165,427,00002,260,992
2May 5, 2021 21:5419,936182,364,187165,468,00002,387,968
3May 5, 2021 21:5419,940191,422,618164,502,0001,003,0002,260,992
4May 5, 2021 21:5419,941194,548,582165,510,00002,260,992
5May 5, 2021 21:5419,943198,749,777163,517,0002,006,0002,510,848
6May 5, 2021 21:5419,943204,421,224164,522,0001,003,0002,260,992
7May 5, 2021 21:5419,944194,451,696164,536,0001,003,0002,256,896
8May 5, 2021 21:5419,947200,559,003165,558,00002,265,088
9May 5, 2021 21:5419,950194,383,186164,582,0001,003,0002,260,992