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 listFeb 22, 2024 02:40Huy Duc LeHuy Duc LeScore: 93,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 22, 2024 02:4092,14358,282,61733,091,0001,002,0002,269,184
2Feb 22, 2024 02:4092,38155,809,42933,176,0001,005,0002,273,280
3Feb 22, 2024 02:4092,57361,218,83532,238,0002,014,0002,527,232
4Feb 22, 2024 02:4092,68656,867,17432,277,0002,017,0002,531,328
5Feb 22, 2024 02:4093,40361,688,26132,527,0002,032,0002,281,472
6Feb 22, 2024 02:4093,54660,694,43033,594,0001,018,0002,285,568
7Feb 22, 2024 02:4093,58160,667,26432,589,0002,036,0002,281,472
8Feb 22, 2024 02:4093,67663,104,62433,641,0001,019,0002,273,280
9Feb 22, 2024 02:4094,22458,213,22133,838,0001,025,0002,523,136
10Feb 22, 2024 02:4095,891103,377,33935,479,60702,273,280
11Feb 22, 2024 02:4097,761105,255,82736,171,73602,232,320
12Feb 22, 2024 02:4098,44394,664,08136,424,06202,269,184