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 3, 2023 21:51Franek KortaFranek KortaScore: 104,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 3, 2023 21:51103,11960,646,53135,142,0003,012,0002,531,328
2Apr 3, 2023 21:51103,16261,379,74737,166,0001,004,0002,445,312
3Apr 3, 2023 21:51103,62457,106,49638,341,00002,441,216
4Apr 3, 2023 21:51103,65156,021,00737,342,0001,009,0002,531,328
5Apr 3, 2023 21:51103,80860,263,32338,409,00002,437,120
6Apr 3, 2023 21:51104,06560,212,77637,491,0001,013,0002,433,024
7Apr 3, 2023 21:51104,33062,195,12338,602,00002,445,312
8Apr 3, 2023 21:51104,58662,805,59338,697,00002,531,328
9Apr 3, 2023 21:51104,99564,538,12238,848,00002,265,088
10Apr 3, 2023 21:51106,360121,200,52339,353,03202,174,976
11Apr 3, 2023 21:51106,950109,644,80339,571,61802,211,840
12Apr 3, 2023 21:51108,432102,179,50240,119,90302,297,856