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 9, 2025 12:01NoSIMD_C#NoSIMD_C#Score: 274,438Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 12:01272,489132,073,60556,899,00043,922,0002,473,984
2Apr 9, 2025 12:01274,438124,141,14459,317,00042,225,0002,486,272
3Apr 9, 2025 12:01275,273128,364,78458,914,00042,937,0002,453,504