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 20:21Josu San MartinJosu San MartinScore: 121,792Success
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 20:21121,14670,935,18643,828,000996,0002,289,664
2Jan 12, 2026 20:21121,79273,581,00344,062,0001,001,0002,342,912
3Jan 12, 2026 20:21122,04667,867,41143,150,0002,007,0002,371,584