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 listMar 18, 2026 06:40limanjun99limanjun99Score: 41,747Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 18, 2026 06:4040,428361,467,797330,505,0001,001,0002,285,568
2Mar 18, 2026 06:4040,670360,737,120331,494,0001,996,0002,506,752
3Mar 18, 2026 06:4040,866368,381,466333,100,0002,000,0002,506,752
4Mar 18, 2026 06:4041,123358,835,126336,209,0001,000,0002,260,992
5Mar 18, 2026 06:4041,747366,151,134341,327,0001,000,0002,260,992
6Mar 18, 2026 06:4042,482371,156,281347,351,0001,001,0002,506,752
7Mar 18, 2026 06:4042,616376,051,848348,451,0001,001,0002,506,752
8Mar 18, 2026 06:4043,157378,306,897350,885,0002,999,0002,289,664
9Mar 18, 2026 06:4044,325394,531,570361,465,0002,002,0002,277,376