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 12, 2026 12:33Victor MerckléVictor MerckléScore: 3,559Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 12, 2026 12:373,49637,519,46426,517,0002,156,0002,129,920
2Jun 12, 2026 12:373,50237,795,85026,143,0002,579,0002,129,920
3Jun 12, 2026 12:373,52637,881,23526,413,0002,501,0002,129,920
4Jun 12, 2026 12:373,55638,118,42626,994,0002,168,0002,134,016
5Jun 12, 2026 12:373,55938,022,76026,969,0002,217,0002,134,016
6Jun 12, 2026 12:373,56138,150,09526,016,0003,190,0002,174,976
7Jun 12, 2026 12:373,58638,436,67026,205,0003,205,0002,174,976
8Jun 12, 2026 12:3712,936115,181,526102,819,0003,262,0002,129,920
9Jun 12, 2026 12:3713,035115,916,582103,688,0003,207,0002,129,920