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 20, 2025 06:57Rajarshi BasuRajarshi BasuScore: 5,317Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 06:575,300201,171,705169,909,0004,997,0002,347,008
2Dec 20, 2025 06:575,307199,481,312171,132,0004,003,0002,514,944
3Dec 20, 2025 06:575,308196,273,630169,161,0006,005,0002,306,048
4Dec 20, 2025 06:575,311197,008,254171,272,0004,006,0002,523,136
5Dec 20, 2025 06:575,317201,876,875169,452,0006,016,0002,514,944
6Dec 20, 2025 06:575,332198,419,472169,964,0005,998,0002,514,944
7Dec 20, 2025 06:575,334197,902,002170,022,0006,000,0002,506,752
8Dec 20, 2025 06:575,340200,014,102169,225,0007,009,0002,510,848
9Dec 20, 2025 06:575,377204,849,142170,434,0007,017,0002,297,856