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 19, 2025 09:12Ian MckibbenIan MckibbenScore: 71,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 19, 2025 09:1270,74947,876,74525,171,0001,006,0002,437,120
2Jan 19, 2025 09:1270,78447,944,44824,176,0002,014,0002,531,328
3Jan 19, 2025 09:1270,85751,113,74624,201,0002,016,0002,531,328
4Jan 19, 2025 09:1270,91648,992,58625,230,0001,009,0002,531,328
5Jan 19, 2025 09:1271,05150,005,05625,278,0001,011,0002,269,184
6Jan 19, 2025 09:1271,13849,380,69026,321,00002,424,832
7Jan 19, 2025 09:1271,14650,284,74326,324,00002,433,024
8Jan 19, 2025 09:1271,17047,409,58124,308,0002,025,0002,437,120
9Jan 19, 2025 09:1271,29754,501,37325,366,0001,014,0002,531,328