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 listJul 6, 2025 11:55Valentin KofmanValentin KofmanScore: 18,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 11:5518,181176,075,199149,088,00002,269,184
2Jul 6, 2025 11:5518,241174,173,523147,586,0001,994,0002,396,160
3Jul 6, 2025 11:5518,249178,231,568149,640,00002,269,184