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 21:56zielajzielajScore: 4,262Success
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 21:564,237158,434,362129,846,0009,988,0002,359,296
2Dec 22, 2025 21:564,240162,022,295128,932,00010,994,0002,424,832
3Dec 22, 2025 21:564,246162,634,006126,120,00014,013,0002,408,448
4Dec 22, 2025 21:564,257171,972,535130,455,00010,035,0002,359,296
5Dec 22, 2025 21:564,262165,307,337129,659,00010,971,0002,412,544
6Dec 22, 2025 21:564,275161,893,198132,079,0009,005,0002,445,312
7Dec 22, 2025 21:564,293165,382,479129,685,00011,971,0002,424,832
8Dec 22, 2025 21:564,299160,136,034133,871,0007,992,0002,424,832
9Dec 22, 2025 21:564,310164,049,542135,209,0007,010,0002,506,752