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 24, 2024 08:34DanielDanielScore: 119,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2024 08:3498,468132,628,77236,433,07202,207,744
2Jul 24, 2024 08:3498,824112,721,73236,564,90602,211,840
3Jul 24, 2024 08:3499,248113,100,86136,721,73002,207,744
4Jul 24, 2024 08:34118,61168,599,87143,886,00002,359,296
5Jul 24, 2024 08:34118,78677,014,19742,953,000998,0002,289,664
6Jul 24, 2024 08:34118,79568,556,64241,957,0001,997,0002,281,472
7Jul 24, 2024 08:34119,03076,052,40044,041,00002,359,296
8Jul 24, 2024 08:34119,12769,424,53843,076,0001,001,0002,453,504
9Jul 24, 2024 08:34119,16272,556,91042,086,0002,004,0002,289,664
10Jul 24, 2024 08:34119,25466,575,56842,119,0002,005,0002,367,488
11Jul 24, 2024 08:34119,36870,355,37742,159,0002,007,0002,363,392
12Jul 24, 2024 08:34119,42773,012,81842,180,0002,008,0002,289,664