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 09:49Rajarshi BasuRajarshi BasuScore: 4,966Success
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 09:494,922190,434,339158,417,0004,010,0002,510,848
2Dec 22, 2025 09:494,940185,084,385159,027,0004,000,0002,347,008
3Dec 22, 2025 09:494,947186,603,686160,252,0003,004,0002,510,848
4Dec 22, 2025 09:494,960186,703,905159,704,0003,992,0002,490,368
5Dec 22, 2025 09:494,966188,374,213159,866,0003,996,0002,400,256
6Dec 22, 2025 09:494,966186,501,376159,881,0003,997,0002,465,792
7Dec 22, 2025 09:494,968186,486,432159,944,0003,998,0002,428,928
8Dec 22, 2025 09:495,009192,916,453161,302,0004,007,0002,523,136
9Dec 22, 2025 09:495,043197,117,167162,425,0004,010,0002,293,760