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 listNov 10, 2025 13:57izotoffizotoffScore: 226,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 13:57226,543113,253,31282,824,000997,0002,363,392
2Nov 10, 2025 13:57226,659110,849,25580,869,0002,995,0002,510,848
3Nov 10, 2025 13:57227,368106,523,40182,123,0002,003,0002,289,664