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:56Rajarshi BasuRajarshi BasuScore: 4,915Success
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:564,842185,616,543155,807,0003,995,0002,514,944
2Dec 22, 2025 10:564,850182,520,044156,063,0004,001,0002,506,752
3Dec 22, 2025 10:564,872182,468,692156,797,0003,994,0002,523,136
4Dec 22, 2025 10:564,891187,934,123157,406,0004,010,0002,375,680
5Dec 22, 2025 10:564,915187,084,611158,180,0004,004,0002,514,944
6Dec 22, 2025 10:564,933185,175,801158,781,0003,994,0002,514,944
7Dec 22, 2025 10:565,016191,979,527161,524,0003,988,0002,400,256
8Dec 22, 2025 10:565,036189,605,606162,195,0004,004,0002,510,848
9Dec 22, 2025 10:565,056189,026,533162,839,0003,996,0002,490,368