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 02:26Josu San MartinJosu San MartinScore: 3,674Success
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 02:273,662131,677,930119,799,0001,071,0002,113,536
2May 13, 2026 02:273,664132,090,410119,836,0001,099,0002,113,536
3May 13, 2026 02:273,668130,897,038119,961,0001,086,0002,113,536
4May 13, 2026 02:273,669132,851,195120,019,0001,076,0002,113,536
5May 13, 2026 02:273,674131,351,052120,137,0001,116,0002,113,536
6May 13, 2026 02:273,679132,110,561120,304,0001,124,0002,113,536
7May 13, 2026 02:273,684130,449,734120,486,0001,105,0002,113,536
8May 13, 2026 02:273,684132,638,376120,484,0001,120,0002,113,536
9May 13, 2026 02:273,686131,381,064120,518,0001,130,0002,113,536