TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listApr 22, 2025 09:49NoSIMD_C#NoSIMD_C#Score: 167,716Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 09:49167,08189,838,38459,826,0001,994,0002,535,424
2Apr 22, 2025 09:49167,08988,208,29759,829,0001,994,0002,539,520
3Apr 22, 2025 09:49167,23286,183,14458,882,0002,994,0002,535,424
4Apr 22, 2025 09:49167,64182,410,89259,026,0003,001,0002,531,328
5Apr 22, 2025 09:49167,71689,836,50160,054,0002,001,0002,547,712
6Apr 22, 2025 09:49167,86290,807,78860,106,0002,003,0002,531,328
7Apr 22, 2025 09:49168,33890,701,14460,276,0002,009,0002,539,520
8Apr 22, 2025 09:49168,38485,692,90258,283,0004,019,0002,564,096
9Apr 22, 2025 09:49168,63290,030,66359,375,0003,019,0002,392,064