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 23:34Josu San MartinJosu San MartinScore: 73,238Success
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 23:3473,01154,240,31225,013,0002,001,0002,289,664
2Jan 12, 2026 23:3473,23854,344,08825,091,0002,007,0002,289,664
3Jan 12, 2026 23:3473,30351,907,11425,113,0002,009,0002,289,664