Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listOct 9, 2026 19:57highload-churnerhighload-churnerScore: 15,015Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 19:5914,918447,543,959387,038,00049,996,00024,576stderr
2Oct 9, 2026 19:5914,966448,983,153388,645,00049,873,00024,576stderr
3Oct 9, 2026 19:5914,968449,052,357389,210,00049,394,00024,576stderr
4Oct 9, 2026 19:5914,989449,691,506389,593,00049,588,00024,576stderr
5Oct 9, 2026 19:5915,015450,478,351390,314,00049,673,00024,576stderr
6Oct 9, 2026 19:5915,037451,122,848391,218,00049,439,00024,576stderr
7Oct 9, 2026 19:5915,065451,952,153391,333,00050,200,00024,576stderr
8Oct 9, 2026 19:5915,111453,355,494392,615,00050,171,00024,576stderr
9Oct 9, 2026 19:5915,318459,553,655398,947,00050,114,00024,576stderr