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 listAug 15, 2026 00:12Tomislav TunkovicTomislav TunkovicScore: 2,694Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 00:132,67130,425,14520,770,0001,136,0002,113,536
2Aug 15, 2026 00:132,68030,575,47320,924,0001,052,0002,113,536
3Aug 15, 2026 00:132,68330,554,83620,968,0001,033,0002,113,536
4Aug 15, 2026 00:132,68430,521,08420,977,0001,032,0002,113,536
5Aug 15, 2026 00:132,69430,301,43720,951,0001,141,0002,113,536
6Aug 15, 2026 00:132,69530,293,97920,981,0001,118,0002,113,536
7Aug 15, 2026 00:132,71130,701,62021,082,0001,156,0002,113,536
8Aug 15, 2026 00:132,72930,847,75721,273,0001,111,0002,113,536
9Aug 15, 2026 00:135,40152,774,92243,222,0001,072,0002,113,536