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 8, 2021 21:36Yurkov AlekseyYurkov AlekseyScore: 105,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 21:36103,68968,829,48936,346,0002,019,0002,289,664
2Jul 8, 2021 21:36104,07863,597,41537,496,0001,013,0002,289,664
3Jul 8, 2021 21:36104,31968,923,67637,583,0001,015,0002,281,472
4Jul 8, 2021 21:36104,35466,397,35637,595,0001,016,0002,289,664
5Jul 8, 2021 21:36104,50063,773,75238,665,00002,289,664
6Jul 8, 2021 21:36104,94668,118,51536,839,0001,991,0002,289,664
7Jul 8, 2021 21:36105,04168,014,85336,872,0001,993,0002,289,664
8Jul 8, 2021 21:36105,67361,854,07437,094,0002,005,0002,289,664
9Jul 8, 2021 21:36106,07064,447,26537,234,0002,012,0002,273,280
10Jul 8, 2021 21:36131,908111,829,34348,806,01002,260,992
11Jul 8, 2021 21:36133,111119,237,01049,251,02602,260,992
12Jul 8, 2021 21:36133,386125,702,54449,352,85302,260,992