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:12Josu San MartinJosu San MartinScore: 69,019Success
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:1268,79548,406,24024,436,0001,018,0002,351,104
2Jan 13, 2026 01:1269,01947,928,12125,537,00002,437,120
3Jan 13, 2026 01:1269,11455,592,98824,550,0001,022,0002,277,376