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 listOct 1, 2026 14:47NicoNicoScore: 30,961Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 1, 2026 14:4830,265259,498,466247,172,0001,005,0002,113,536
2Oct 1, 2026 14:4830,617262,325,334250,058,0001,004,0002,113,536
3Oct 1, 2026 14:4830,715263,079,050250,865,0001,003,0002,113,536
4Oct 1, 2026 14:4830,834264,116,442251,839,0001,004,0002,113,536
5Oct 1, 2026 14:4830,961265,061,654252,881,0001,005,0002,113,536
6Oct 1, 2026 14:4831,176266,361,971254,640,0001,004,0002,113,536
7Oct 1, 2026 14:4831,284267,569,200254,514,0002,019,0002,113,536
8Oct 1, 2026 14:4831,420268,945,344256,644,0001,004,0002,113,536
9Oct 1, 2026 14:4831,959273,271,380261,061,0001,005,0002,113,536