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 11, 2025 15:51Rajarshi BasuRajarshi BasuScore: 23,614Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 11, 2025 15:5123,283799,631,684749,342,00018,983,0002,269,184
2Dec 11, 2025 15:5123,286792,833,168752,455,00015,988,0002,416,640
3Dec 11, 2025 15:5123,477800,069,838761,758,00012,995,0002,420,736
4Dec 11, 2025 15:5123,499804,858,670759,482,00015,989,0002,383,872
5Dec 11, 2025 15:5123,614807,521,021761,294,00017,983,0002,490,368
6Dec 11, 2025 15:5124,590840,620,372791,498,00019,987,0002,383,872
7Dec 11, 2025 15:5125,157854,437,020813,206,00016,983,0002,441,216
8Dec 11, 2025 15:5125,164856,082,595813,433,00016,967,0002,351,104
9Dec 11, 2025 15:5125,564868,710,638825,639,00017,970,0002,375,680