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 listJan 28, 2025 00:06Ian MckibbenIan MckibbenScore: 11,678Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 00:0611,620117,060,66595,284,00002,441,216
2Jan 28, 2025 00:0611,633114,135,72195,387,00002,387,968
3Jan 28, 2025 00:0611,667120,941,82895,672,00002,310,144
4Jan 28, 2025 00:0611,677118,592,50295,752,00002,404,352
5Jan 28, 2025 00:0611,678130,241,82093,763,0001,994,0002,437,120
6Jan 28, 2025 00:0611,683116,071,56193,804,0001,995,0002,437,120
7Jan 28, 2025 00:0611,807124,549,28594,819,0001,996,0002,310,144
8Jan 28, 2025 00:0611,831123,181,22594,016,0003,000,0002,441,216
9Jan 28, 2025 00:0611,855117,650,18096,206,0001,002,0002,408,448