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 12, 2026 05:04Josu San MartinJosu San MartinScore: 72,578Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 05:0472,54350,411,86124,853,0001,988,0002,347,008
2Jan 12, 2026 05:0472,57855,636,09826,854,00002,355,200
3Jan 12, 2026 05:0472,63053,069,57624,883,0001,990,0002,363,392