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 01:00Josu San MartinJosu San MartinScore: 71,265Success
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 01:0071,16249,066,51224,305,0002,025,0002,342,912
2Jan 13, 2026 01:0071,26548,023,20223,326,0003,042,0002,277,376
3Jan 13, 2026 01:0071,58649,612,37025,469,0001,018,0002,277,376