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 listAug 15, 2026 14:30Tomislav TunkovicTomislav TunkovicScore: 3,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 14:323,510124,091,264114,702,0001,138,00024,576
2Aug 15, 2026 14:323,512124,135,926114,914,0001,001,00024,576
3Aug 15, 2026 14:323,513124,399,535114,827,0001,115,00024,576
4Aug 15, 2026 14:323,518125,747,816115,005,0001,102,00024,576
5Aug 15, 2026 14:323,518124,408,944114,981,0001,141,00024,576
6Aug 15, 2026 14:323,522124,486,380115,240,0001,005,00024,576
7Aug 15, 2026 14:323,537126,357,996115,731,0001,011,00024,576
8Aug 15, 2026 14:323,547125,289,513116,061,0001,010,00024,576
9Aug 15, 2026 14:323,548125,272,778116,080,0001,005,00024,576