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 09:54Andrey TsvetkovAndrey TsvetkovScore: 120,641Success
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 09:54120,35772,654,15944,532,00002,506,752
2Jul 14, 2021 09:54120,44670,229,96743,553,0001,012,0002,334,720
3Jul 14, 2021 09:54120,50869,324,48042,562,0002,026,0002,334,720
4Jul 14, 2021 09:54120,51974,638,87042,566,0002,026,0002,371,584
5Jul 14, 2021 09:54120,54169,769,48344,600,00002,334,720
6Jul 14, 2021 09:54120,60871,020,15342,597,0002,028,0002,334,720
7Jul 14, 2021 09:54120,64168,517,58344,637,00002,510,848
8Jul 14, 2021 09:54121,08671,935,53042,811,0001,991,0002,510,848
9Jul 14, 2021 09:54121,22272,465,87942,859,0001,993,0002,334,720
10Jul 14, 2021 09:54123,251110,843,56845,602,80202,183,168
11Jul 14, 2021 09:54123,327104,163,66445,630,87302,183,168
12Jul 14, 2021 09:54123,597104,241,22245,731,02902,179,072