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:08Ian MckibbenIan MckibbenScore: 71,054Success
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:0870,44346,019,62525,062,0001,002,0002,437,120
2Jan 19, 2025 09:0870,91954,028,57324,222,0002,018,0002,531,328
3Jan 19, 2025 09:0870,92745,248,86425,234,0001,009,0002,531,328
4Jan 19, 2025 09:0871,03052,614,18426,281,00002,433,024
5Jan 19, 2025 09:0871,05447,716,91426,290,00002,428,928
6Jan 19, 2025 09:0871,05946,242,83325,281,0001,011,0002,420,736
7Jan 19, 2025 09:0871,33248,915,98626,393,00002,510,848
8Jan 19, 2025 09:0871,49746,911,29926,454,00002,269,184
9Jan 19, 2025 09:0871,50346,282,53826,456,00002,531,328