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 25, 2026 16:01Zhou180Zhou180Score: 3,948Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 16:023,84540,659,61329,382,0002,153,0002,117,632
2Jun 25, 2026 16:023,85540,807,96529,493,0002,119,0002,117,632
3Jun 25, 2026 16:023,86740,858,16029,561,0002,151,0002,117,632
4Jun 25, 2026 16:023,94641,503,81730,090,0002,269,0002,117,632
5Jun 25, 2026 16:023,94841,509,74130,132,0002,248,0002,117,632
6Jun 25, 2026 16:023,96241,559,90430,282,0002,207,0002,117,632
7Jun 25, 2026 16:023,96441,612,90730,259,0002,248,0002,117,632
8Jun 25, 2026 16:023,99041,833,49230,435,0002,285,0002,117,632
9Jun 25, 2026 16:024,02142,087,43730,682,0002,298,0002,117,632