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, 2026 02:24Victor MerckléVictor MerckléScore: 3,407Success
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, 2026 02:253,34034,977,85826,348,0001,040,0002,113,536
2Jun 22, 2026 02:253,34734,971,17526,399,0001,047,0002,113,536
3Jun 22, 2026 02:253,37435,281,00826,611,0001,063,0002,113,536
4Jun 22, 2026 02:253,40235,545,01526,843,0001,054,0002,113,536
5Jun 22, 2026 02:253,40735,341,98026,910,0001,033,0002,113,536
6Jun 22, 2026 02:253,42336,954,52527,005,0001,068,0002,113,536
7Jun 22, 2026 02:253,43835,792,61227,159,0001,034,0002,113,536
8Jun 22, 2026 02:256,22258,502,91450,008,0001,017,0002,113,536
9Jun 22, 2026 02:2512,781112,251,928102,632,0002,176,0002,113,536