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 28, 2024 08:27NoSIMD_C#NoSIMD_C#Score: 277,841Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 08:27277,832135,208,44853,894,00048,904,0002,535,424
2Nov 28, 2024 08:27277,841129,935,68053,896,00048,905,0002,519,040
3Nov 28, 2024 08:27281,116143,526,06055,007,00049,006,0002,519,040