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 22:23Yurkov AlekseyYurkov AlekseyScore: 182,451Success
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 22:23182,423128,009,56467,496,64202,273,280
2Jul 8, 2021 22:23182,451125,703,98667,506,80102,269,184
3Jul 8, 2021 22:23183,652132,590,90167,951,16802,277,376