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 listMar 3, 2026 22:56olliecrowolliecrowScore: 176,216Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 22:56175,87686,314,94064,073,0001,001,0002,523,136
2Mar 3, 2026 22:56176,21690,059,77564,197,0001,003,0002,523,136
3Mar 3, 2026 22:56176,23595,421,53064,204,0001,003,0002,277,376