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 06:57NoSIMD_C#NoSIMD_C#Score: 318,962Success
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 06:57317,865147,377,93974,386,00043,224,0002,289,664
2Nov 23, 2024 06:57318,962148,379,00372,010,00046,006,0002,510,848
3Nov 23, 2024 06:57319,957150,283,27271,231,00047,153,0002,506,752