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 listNov 23, 2024 17:01NoSIMD_C#NoSIMD_C#Score: 278,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 17:01277,868132,695,41457,894,00044,917,0002,498,560
2Nov 23, 2024 17:01278,049128,143,48158,930,00043,948,0002,547,712
3Nov 23, 2024 17:01281,127131,039,91955,009,00049,008,0002,379,776