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 listFeb 28, 2026 14:43NoSIMD_C#NoSIMD_C#Score: 140,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2026 14:43128,4161,085,227,504900,154,000152,856,0002,392,064
2Feb 28, 2026 14:43133,1071,117,406,857930,554,000160,922,0002,465,792
3Feb 28, 2026 14:43136,6041,145,307,905952,280,000167,873,0002,453,504
4Feb 28, 2026 14:43137,9201,163,493,624973,090,000157,852,0002,400,256
5Feb 28, 2026 14:43140,8111,185,936,073986,701,000167,949,0002,424,832
6Feb 28, 2026 14:43150,0251,256,454,4071,062,317,000167,892,0002,408,448
7Feb 28, 2026 14:43151,6721,271,232,2061,071,886,000171,821,0002,392,064
8Feb 28, 2026 14:43159,4431,341,748,1501,138,503,000168,926,0002,412,544
9Feb 28, 2026 14:43170,1561,424,153,5401,231,363,000163,915,0002,408,448