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 26, 2026 08:06Zhou180Zhou180Score: 3,581Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 08:083,49637,856,48027,603,0001,066,0002,117,632
2Jun 26, 2026 08:083,50437,800,50327,675,0001,063,0002,117,632
3Jun 26, 2026 08:083,51437,959,72527,764,0001,053,0002,117,632
4Jun 26, 2026 08:083,57238,463,43628,258,0001,040,0002,117,632
5Jun 26, 2026 08:083,58138,516,22228,336,0001,031,0002,117,632
6Jun 26, 2026 08:0821,147182,520,480171,395,0002,012,0002,117,632
7Jun 26, 2026 08:0821,355184,227,208173,101,0002,010,0002,117,632
8Jun 26, 2026 08:0821,430184,831,925173,714,0002,012,0002,117,632
9Jun 26, 2026 08:0821,694187,025,559175,884,0002,011,0002,117,632