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 10:54Rajarshi BasuRajarshi BasuScore: 4,876Success
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 10:544,820190,357,566156,053,0003,001,0002,297,856
2Dec 22, 2025 10:544,823181,912,002156,150,0003,002,0002,514,944
3Dec 22, 2025 10:544,848185,116,585156,000,0004,000,0002,514,944
4Dec 22, 2025 10:544,860186,442,291156,359,0004,009,0002,297,856
5Dec 22, 2025 10:544,862188,932,390156,427,0004,010,0002,514,944
6Dec 22, 2025 10:544,869183,963,346156,700,0003,992,0002,514,944
7Dec 22, 2025 10:544,876190,911,430157,904,0002,998,0002,514,944
8Dec 22, 2025 10:544,883188,494,869157,122,0004,003,0002,297,856
9Dec 22, 2025 10:544,915190,071,620158,201,0004,005,0002,314,240
10Dec 22, 2025 10:545,063192,301,110163,077,0004,001,0002,514,944
11Dec 22, 2025 10:545,309209,751,122171,185,0004,004,0002,514,944
12Dec 22, 2025 10:545,518203,722,967178,100,0004,002,0002,306,048