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 listSep 12, 2026 20:47SparkyRobinSparkyRobinScore: 111,234Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 20:4888,369735,621,757572,834,000151,797,0002,113,536
2Sep 12, 2026 20:48100,742837,179,236673,918,000152,172,0002,113,536
3Sep 12, 2026 20:48105,828878,180,867714,487,000153,304,0002,113,536
4Sep 12, 2026 20:48109,906911,620,610748,247,000152,983,0002,113,536
5Sep 12, 2026 20:48111,234922,493,835759,594,000152,528,0002,113,536
6Sep 12, 2026 20:48112,702935,310,213775,642,000148,515,0002,113,536
7Sep 12, 2026 20:48114,360948,235,067788,365,000149,395,0002,113,536
8Sep 12, 2026 20:48115,586958,245,685795,590,000152,219,0002,113,536
9Sep 12, 2026 20:48121,1421,003,799,015843,062,000150,310,0002,113,536