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,040Success
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:4935,415316,805,313290,401,00002,265,088
2Apr 28, 2025 06:5135,451312,059,455288,702,0001,997,0002,277,376
3Apr 28, 2025 06:4935,617320,406,704290,059,0002,000,0002,265,088
4Apr 28, 2025 06:4935,725317,219,254289,950,0002,999,0002,277,376
5Apr 28, 2025 06:4935,788316,977,702292,460,0001,001,0002,363,392
6Apr 28, 2025 06:4935,844315,057,529292,922,000999,0002,277,376
7Apr 28, 2025 06:5136,040327,437,872293,535,0001,996,0002,277,376
8Apr 28, 2025 06:5136,091318,830,297293,945,0001,999,0002,269,184
9Apr 28, 2025 06:4936,194317,614,105294,793,0001,998,0002,277,376
10Apr 28, 2025 06:4936,253320,364,882295,270,0002,001,0002,277,376
11Apr 28, 2025 06:4936,343319,974,424297,010,0001,000,0002,379,776
12Apr 28, 2025 06:4936,709328,433,724298,016,0003,000,0002,383,872