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 8, 2026 07:43Rajarshi BasuRajarshi BasuScore: 77,044Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 07:4267,543579,257,652429,887,000123,967,0002,326,528
2Jan 8, 2026 07:4568,113585,743,748443,626,000114,903,0002,293,760
3Jan 8, 2026 07:4569,083595,943,764440,594,000125,884,0002,326,528
4Jan 8, 2026 07:4169,326594,762,476456,578,000111,896,0002,285,568
5Jan 8, 2026 07:4171,116615,460,254484,128,00099,026,0002,326,528
6Jan 8, 2026 07:4271,202606,630,816468,885,000114,971,0002,326,528
7Jan 8, 2026 07:4177,044658,232,795508,809,000122,954,0002,293,760
8Jan 8, 2026 07:4580,499692,911,290542,255,000117,838,0002,326,528
9Jan 8, 2026 07:4385,741729,840,690583,235,000119,842,0002,285,568
10Jan 8, 2026 07:4388,611753,581,375608,673,000117,936,0002,490,368
11Jan 8, 2026 07:4290,887771,834,114628,388,000116,886,0002,297,856
12Jan 8, 2026 07:43105,596893,146,185734,060,000131,831,0002,285,568