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 11, 2025 19:55Rajarshi BasuRajarshi BasuScore: 14,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 19:5514,402498,249,566456,253,00019,010,0002,273,280
2Dec 11, 2025 19:5514,443501,648,875455,644,00020,983,0002,404,352
3Dec 11, 2025 19:5514,465507,481,528456,388,00020,971,0002,285,568
4Dec 11, 2025 19:5514,470505,367,305458,516,00018,979,0002,519,040
5Dec 11, 2025 19:5514,585515,436,481461,302,00020,013,0002,281,472
6Dec 11, 2025 19:5514,614515,569,476459,263,00023,013,0002,281,472
7Dec 11, 2025 19:5514,635513,516,458463,944,00018,997,0002,408,448
8Dec 11, 2025 19:5514,837514,882,741465,644,00023,981,0002,281,472
9Dec 11, 2025 19:5514,875518,783,511470,916,00019,954,0002,404,352