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 27, 2024 17:36Matthew SillsMatthew SillsScore: 498,863Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 17:36496,146247,266,209183,574,09602,265,088
2Jul 27, 2024 17:36498,863247,673,598184,579,37902,269,184
3Jul 27, 2024 17:36501,696241,702,258185,627,63402,269,184