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 listJan 1, 2026 17:40zielajzielajScore: 3,497Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 17:403,418140,083,875110,787,0001,996,0002,424,832
2Jan 1, 2026 17:403,457136,681,978112,087,0002,001,0002,424,832
3Jan 1, 2026 17:403,482137,550,160112,914,0001,998,0002,535,424
4Jan 1, 2026 17:403,483139,541,340111,941,0002,998,0002,416,640
5Jan 1, 2026 17:403,497144,227,844114,408,0001,003,0002,420,736
6Jan 1, 2026 17:403,580145,941,115116,146,0002,002,0002,273,280
7Jan 1, 2026 17:403,604146,697,812116,936,0001,998,0002,338,816
8Jan 1, 2026 17:403,658144,146,657118,715,0002,012,0002,535,424
9Jan 1, 2026 17:403,787151,607,598123,986,000999,0002,408,448