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 listMay 16, 2026 06:25M-RochatM-RochatScore: 97,034Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 06:2796,4803,194,904,5373,146,957,00036,884,0002,113,536
2May 16, 2026 06:2796,5873,196,868,6763,151,278,00036,124,0002,113,536
3May 16, 2026 06:2796,8093,204,908,3473,158,474,00036,247,0002,113,536
4May 16, 2026 06:2796,9573,209,534,7113,162,484,00037,114,0002,113,536
5May 16, 2026 06:2797,0343,213,271,5523,164,794,00037,351,0002,113,536
6May 16, 2026 06:2797,1053,213,807,0483,167,818,00036,679,0002,113,536
7May 16, 2026 06:2797,1183,214,561,4033,168,464,00036,461,0002,113,536
8May 16, 2026 06:2797,2533,218,368,7353,170,645,00038,721,0002,113,536
9May 16, 2026 06:2797,3383,221,157,2923,177,023,00035,152,0002,113,536