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 07:25Andrei GrazhdankovAndrei GrazhdankovScore: 84,330Success
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 08:5284,307755,640,899699,750,88102,236,416
2May 24, 2021 08:5284,311798,037,752699,778,92602,224,128
3May 24, 2021 07:2484,320765,739,151699,856,95902,228,224
4May 24, 2021 07:2584,326766,290,147699,901,79802,228,224
5May 24, 2021 07:2484,330759,344,627699,936,34802,224,128
6May 24, 2021 07:2484,330762,956,111699,941,07602,215,936
7May 24, 2021 07:2584,333763,224,452699,964,15702,232,320
8May 24, 2021 08:5284,337762,223,694699,999,77402,211,840
9May 24, 2021 07:2584,372761,173,157700,284,26002,224,128