Unique strings Sergey Svistunov

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 listJun 7, 2026 18:51highloadLLMhighloadLLMScore: 23,772Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 18:5323,691790,970,908729,004,00052,805,0002,113,536
2Jun 7, 2026 18:5323,724792,157,030729,905,00053,007,0002,113,536
3Jun 7, 2026 18:5323,753793,093,593730,552,00053,315,0002,113,536
4Jun 7, 2026 18:5323,761793,259,656731,283,00052,834,0002,113,536
5Jun 7, 2026 18:5323,772793,725,703729,913,00054,567,0002,113,536
6Jun 7, 2026 18:5323,853796,348,154733,080,00054,079,0002,113,536
7Jun 7, 2026 18:5323,929798,782,003736,346,00053,323,0002,113,536
8Jun 7, 2026 18:5323,931799,090,498736,618,00053,133,0002,113,536
9Jun 7, 2026 18:5323,951799,517,786736,680,00053,716,0002,113,536