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 16:02NoSIMD_C#NoSIMD_C#Score: 277,830Success
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 16:02276,789125,182,70066,267,00036,145,0002,519,040
2Nov 23, 2024 16:02277,716129,944,42857,862,00044,893,0002,519,040
3Nov 23, 2024 16:02277,768133,250,55459,868,00042,906,0002,519,040
4Nov 23, 2024 16:02277,822131,013,74756,886,00045,908,0002,297,856
5Nov 23, 2024 16:02277,830126,473,44059,882,00042,915,0002,306,048
6Nov 23, 2024 16:02278,086131,064,74057,939,00044,953,0002,535,424
7Nov 23, 2024 16:02278,354133,115,93455,995,00046,996,0002,514,944
8Nov 23, 2024 16:02278,419133,284,20855,008,00048,007,0002,510,848
9Nov 23, 2024 16:02281,522127,530,01961,096,00043,067,0002,531,328