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 listMar 27, 2024 19:53emily graceemily graceScore: 1,092,763Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 27, 2024 19:531,085,79512,220,161,7588,903,519,15202,232,320
2Mar 27, 2024 19:531,092,76312,937,204,9398,960,657,73702,220,032
3Mar 27, 2024 19:531,101,65613,154,128,2739,033,580,41002,248,704