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:03Zhou180Zhou180Score: 21,359Success
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:043,45837,458,87927,324,0001,033,0002,117,632
2Jun 26, 2026 08:043,51637,935,21927,786,0001,052,0002,117,632
3Jun 26, 2026 08:043,53738,080,76527,973,0001,032,0002,117,632
4Jun 26, 2026 08:043,56738,380,44328,210,0001,044,0002,117,632
5Jun 26, 2026 08:0421,359185,671,508173,134,0002,011,0002,117,632
6Jun 26, 2026 08:0421,534185,701,830174,574,0002,010,0002,117,632
7Jun 26, 2026 08:0421,562185,977,542174,802,0002,011,0002,117,632
8Jun 26, 2026 08:0421,668186,789,799175,671,0002,012,0002,117,632
9Jun 26, 2026 08:0422,060190,005,743178,882,0002,011,0002,117,632