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 listMay 6, 2025 20:08Aniruddha DebAniruddha DebScore: 12,587Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 6, 2025 20:0812,234125,802,455100,319,00002,314,240
2May 6, 2025 20:0812,432129,276,052100,947,000999,0002,379,776
3May 6, 2025 20:0812,541128,713,868100,839,0001,996,0002,441,216
4May 6, 2025 20:0812,566126,805,068102,039,0001,000,0002,473,984
5May 6, 2025 20:0812,587124,176,055100,210,0003,006,0002,318,336
6May 6, 2025 20:0812,594126,934,553102,272,0001,002,0002,277,376
7May 6, 2025 20:0812,665130,765,199101,856,0001,997,0002,347,008
8May 6, 2025 20:0812,741127,700,838102,470,0002,009,0002,510,848
9May 6, 2025 20:0813,153131,944,957106,859,000998,0002,416,640