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 listApr 18, 2025 23:43emily graceemily graceScore: 73,062Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 23:4372,54651,723,56524,854,0001,988,0002,527,232
2Apr 18, 2025 23:4373,06248,849,83826,032,0001,001,0002,387,968
3Apr 18, 2025 23:4376,19556,882,69426,179,0002,013,0002,289,664