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 23, 2025 10:06zielajzielajScore: 4,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 23, 2025 10:064,244159,490,777134,049,0006,002,0002,473,984
2Dec 23, 2025 10:064,248162,816,176132,160,0008,009,0002,392,064
3Dec 23, 2025 10:064,250159,343,565131,248,0009,017,0002,412,544
4Dec 23, 2025 10:064,262166,409,084131,670,0008,977,0002,400,256
5Dec 23, 2025 10:064,263170,653,983126,709,00013,968,0002,408,448
6Dec 23, 2025 10:064,278172,872,363126,146,00015,017,0002,498,560
7Dec 23, 2025 10:064,287170,247,658131,447,00010,034,0002,461,696
8Dec 23, 2025 10:064,305163,651,315131,062,00011,005,0002,428,928
9Dec 23, 2025 10:064,513168,389,540134,935,00013,993,0002,461,696