TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listApr 9, 2023 16:40Franek KortaFranek KortaScore: 77,254Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2023 16:4075,26851,646,99426,855,000994,0002,445,312
2Apr 9, 2023 16:4075,51953,506,96625,947,0001,995,0002,531,328
3Apr 9, 2023 16:4076,14953,169,81826,088,0002,087,0002,441,216
4Apr 9, 2023 16:4076,63555,137,62628,355,00002,269,184
5Apr 9, 2023 16:4076,68646,379,11028,374,00002,441,216
6Apr 9, 2023 16:4076,93053,492,18127,448,0001,016,0002,531,328
7Apr 9, 2023 16:4077,25458,799,94128,584,00002,441,216
8Apr 9, 2023 16:4077,97652,725,34026,862,0001,989,0002,445,312
9Apr 9, 2023 16:4078,77051,395,49728,140,0001,005,0002,531,328
10Apr 9, 2023 16:4081,11196,992,31530,011,25002,297,856
11Apr 9, 2023 16:4081,16596,964,78230,030,88002,297,856
12Apr 9, 2023 16:4082,18999,352,49230,409,76402,301,952