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 13, 2026 07:17Josu San MartinJosu San MartinScore: 3,487Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 07:183,470125,448,700113,479,0001,052,0002,113,536
2May 13, 2026 07:183,470125,207,213113,481,0001,059,0002,113,536
3May 13, 2026 07:183,473124,062,407113,624,0001,006,0002,113,536
4May 13, 2026 07:183,482125,685,524113,799,0001,108,0002,113,536
5May 13, 2026 07:183,487124,290,579113,971,0001,111,0002,113,536
6May 13, 2026 07:183,489125,664,254114,012,0001,129,0002,113,536
7May 13, 2026 07:183,490127,114,417114,061,0001,126,0002,113,536
8May 13, 2026 07:183,490125,875,225114,071,0001,128,0002,113,536
9May 13, 2026 07:183,492125,887,624114,126,0001,131,0002,113,536