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 listDec 22, 2025 04:28Josu San MartinJosu San MartinScore: 32,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 22, 2025 15:0232,2621,092,810,8031,049,663,00014,995,0002,310,144
2Dec 22, 2025 15:0232,5631,100,289,5141,061,569,00012,994,0002,506,752
3Dec 22, 2025 15:0232,7101,103,524,9931,063,438,00015,991,0002,355,200
4Dec 22, 2025 04:2832,7931,107,576,0911,062,185,00019,984,0002,453,504
5Dec 22, 2025 04:2833,2011,124,348,5931,082,663,00012,983,0002,293,760
6Dec 22, 2025 04:2833,2631,133,965,7161,082,687,00014,981,0002,428,928