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 listOct 20, 2026 07:46e1011e1011Score: 92,962Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 07:4989,20043,896,98231,888,0001,116,0002,113,536
2Oct 20, 2026 07:4989,66444,017,00032,066,0001,110,0002,113,536
3Oct 20, 2026 07:4990,71344,494,91232,457,0001,107,0002,113,536
4Oct 20, 2026 07:4992,62445,718,64633,090,0001,181,0002,113,536
5Oct 20, 2026 07:4992,96245,272,07333,216,0001,180,0002,113,536
6Oct 20, 2026 07:4994,30849,495,94833,671,0001,223,0002,113,536
7Oct 20, 2026 07:4994,88145,993,71233,994,0001,112,0002,113,536
8Oct 20, 2026 07:4996,62446,696,55334,637,0001,114,0002,113,536
9Oct 20, 2026 07:49101,58648,534,99736,449,0001,138,0002,113,536