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 17, 2026 16:53T PrathamT PrathamScore: 108,072Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 16:5371,496614,427,946448,440,000137,828,0002,310,144
2Mar 17, 2026 16:5396,829820,610,562654,172,000139,823,0002,310,144
3Mar 17, 2026 16:53100,785850,177,319685,536,000140,904,0002,318,336
4Mar 17, 2026 16:53102,432871,062,334701,118,000138,825,0002,433,024
5Mar 17, 2026 16:53108,072908,257,737743,320,000142,869,0002,297,856
6Mar 17, 2026 16:53109,968932,886,278759,937,000141,801,0002,314,240
7Mar 17, 2026 16:53114,527969,021,326800,252,000138,870,0002,318,336
8Mar 17, 2026 16:53122,0531,029,938,115859,997,000140,835,0002,277,376
9Mar 17, 2026 16:53123,4011,039,954,238872,039,000139,846,0002,277,376