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 listJan 27, 2025 16:50Oleg KovalovOleg KovalovScore: 76,309Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 27, 2025 16:5075,172642,521,951443,574,000172,834,0002,387,968
2Jan 27, 2025 16:5076,309650,550,196456,805,000168,928,0002,277,376
3Jan 27, 2025 16:5091,192777,773,959573,829,000173,948,0002,387,968