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:34Adam FolwarcznyAdam FolwarcznyScore: 65,372Success
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:3461,778532,474,261503,584,0002,997,0002,404,352
2Jun 22, 2025 20:3463,217544,054,229518,378,00002,519,040
3Jun 22, 2025 20:3464,329554,090,538526,495,000999,0002,383,872
4Jun 22, 2025 20:3464,359553,681,826526,746,000999,0002,383,872
5Jun 22, 2025 20:3465,372563,623,091535,047,0001,000,0002,392,064
6Jun 22, 2025 20:3466,213566,360,950540,947,0001,999,0002,392,064
7Jun 22, 2025 20:3466,334567,951,536541,941,0001,999,0002,387,968
8Jun 22, 2025 20:3466,568576,196,740543,859,0001,999,0002,256,896
9Jun 22, 2025 20:3467,034576,453,418547,683,0001,998,0002,387,968