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 16, 2025 00:03emily graceemily graceScore: 152,424Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 16, 2025 00:03150,93585,313,44154,849,000997,0002,269,184
2Apr 16, 2025 00:03152,42480,156,33454,383,0002,014,0002,273,280
3Apr 16, 2025 00:03152,87678,260,22355,554,0001,010,0002,269,184