Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listApr 28, 2025 06:51KeefeKeefeScore: 36,227Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 28, 2025 06:5135,702322,160,554291,756,000999,0002,527,232
2Apr 28, 2025 06:5136,227320,846,015295,062,0002,000,0002,441,216
3Apr 28, 2025 06:5136,471325,261,665298,061,0001,000,0002,445,312