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 19:27emily graceemily graceScore: 72,527Success
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 19:2772,50354,250,43724,839,0001,987,0002,289,664
2Apr 18, 2025 19:2772,52752,482,84125,842,000993,0002,273,280
3Apr 18, 2025 19:2773,81656,840,58325,289,0002,023,0002,273,280