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 listJun 22, 2025 20:49Adam FolwarcznyAdam FolwarcznyScore: 56,770Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2025 20:4954,222472,418,947443,618,000999,0002,519,040
2Jun 22, 2025 20:4955,090477,543,912450,740,000999,0002,510,848
3Jun 22, 2025 20:4955,132474,364,727451,079,0001,000,0002,506,752
4Jun 22, 2025 20:4956,516488,207,758462,435,0001,000,0002,379,776
5Jun 22, 2025 20:4956,770492,497,810463,516,0001,997,0002,510,848
6Jun 22, 2025 20:4957,305497,043,998468,905,000999,0002,506,752
7Jun 22, 2025 20:4957,585499,671,338472,195,00002,260,992
8Jun 22, 2025 20:4958,031501,797,654474,858,000999,0002,510,848
9Jun 22, 2025 20:4959,636515,241,161488,017,0001,000,0002,498,560