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 8, 2025 19:20Adam FolwarcznyAdam FolwarcznyScore: 104,027Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2025 19:206,93780,196,71245,904,00010,977,0002,408,448
2Jul 8, 2025 19:20104,027879,790,496741,151,000111,871,0002,404,352
3Jul 8, 2025 19:20153,6501,283,562,7331,159,015,000100,914,0002,387,968