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 17, 2025 06:27Ian MckibbenIan MckibbenScore: 81,251Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 17, 2025 06:2781,05955,833,85027,993,0001,999,0002,289,664
2Jan 17, 2025 06:2781,25153,834,52628,059,0002,004,0002,269,184
3Jan 17, 2025 06:2781,69256,208,13028,211,0002,015,0002,289,664