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 18, 2025 08:24Emanuele BolognesiEmanuele BolognesiScore: 767,897Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 08:24759,578306,534,056110,017,000171,027,0002,404,352
2Apr 18, 2025 08:24767,897308,544,873110,047,000174,075,0002,396,160
3Apr 18, 2025 08:24776,754316,862,351110,768,000176,631,0002,396,160