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 listJul 6, 2025 21:20Valentin KofmanValentin KofmanScore: 15,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 21:2015,043144,592,968123,354,00002,408,448
2Jul 6, 2025 21:2015,400149,503,251125,280,0001,002,0002,486,272
3Jul 6, 2025 21:2015,632154,853,616126,184,0002,002,0002,408,448