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 listJul 15, 2025 22:06Valentin KofmanValentin KofmanScore: 65,422Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 22:0665,36846,575,30224,186,00002,281,472
2Jul 15, 2025 22:0665,42246,267,54922,189,0002,017,0002,371,584
3Jul 15, 2025 22:0665,84148,172,46522,331,0002,030,0002,281,472