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 listApr 17, 2026 22:53Charles CabergsCharles CabergsScore: 13,157Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 17, 2026 22:5313,087135,577,387106,309,0001,002,0002,498,560
2Apr 17, 2026 22:5313,108137,961,481105,478,0002,009,0002,445,312
3Apr 17, 2026 22:5313,119134,639,933107,577,00002,379,776
4Apr 17, 2026 22:5313,121134,009,416102,612,0004,981,0002,285,568
5Apr 17, 2026 22:5313,157136,715,149104,893,0002,996,0002,408,448
6Apr 17, 2026 22:5313,162134,840,681105,933,0001,998,0002,412,544
7Apr 17, 2026 22:5313,172134,872,529105,012,0003,000,0002,379,776
8Apr 17, 2026 22:5313,195133,093,558106,200,0002,003,0002,338,816
9Apr 17, 2026 22:5313,215136,871,998104,346,0004,013,0002,433,024