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 listJan 18, 2026 04:25Josu San MartinJosu San MartinScore: 8,995Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 04:258,988104,028,83970,712,0002,987,0002,453,504
2Jan 18, 2026 04:258,99599,455,66371,766,0001,993,0002,486,272
3Jan 18, 2026 04:259,011108,054,75471,897,0001,997,0002,424,832