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 listJan 13, 2026 00:48Josu San MartinJosu San MartinScore: 69,295Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 00:4869,12454,928,57525,576,00002,347,008
2Jan 13, 2026 00:4869,29551,556,93224,614,0001,025,0002,277,376
3Jan 13, 2026 00:4869,31656,639,40025,647,00002,334,720