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 listJul 14, 2021 14:10Yuriy LyfenkoYuriy LyfenkoScore: 88,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2021 14:1086,770553,467,69030,099,0002,006,0002,326,528
2Jul 14, 2021 14:1087,024551,580,46229,181,0003,018,0002,514,944
3Jul 14, 2021 14:1087,157555,316,77429,225,0003,023,0002,326,528
4Jul 14, 2021 14:1087,627556,482,34831,409,0001,013,0002,326,528
5Jul 14, 2021 14:1088,059563,720,28630,546,0002,036,0002,326,528
6Jul 14, 2021 14:1088,086560,147,25930,617,0001,975,0002,326,528
7Jul 14, 2021 14:1088,195558,281,76231,613,0001,019,0002,326,528
8Jul 14, 2021 14:1088,208595,277,47732,636,97702,252,800
9Jul 14, 2021 14:1088,589562,995,43430,792,0001,986,0002,330,624
10Jul 14, 2021 14:1088,619555,232,46529,809,0002,980,0002,330,624
11Jul 14, 2021 14:1088,654588,962,63132,801,83202,248,704
12Jul 14, 2021 14:1089,285626,621,95133,035,40202,187,264