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 14:52Rajarshi BasuRajarshi BasuScore: 5,134Success
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 14:525,051200,383,547161,664,0005,020,0002,465,792
2Dec 20, 2025 14:525,063196,354,156161,063,0006,002,0002,367,488
3Dec 20, 2025 14:525,068192,726,747162,239,0005,007,0002,510,848
4Dec 20, 2025 14:525,091190,350,670163,010,0005,000,0002,363,392
5Dec 20, 2025 14:525,134193,803,918162,393,0007,016,0002,519,040
6Dec 20, 2025 14:525,239203,802,986165,888,0006,995,0002,465,792
7Dec 20, 2025 14:525,321200,293,802172,589,0002,992,0002,519,040
8Dec 20, 2025 14:525,670206,159,366182,097,0005,002,0002,277,376
9Dec 20, 2025 14:525,753215,877,497183,840,0005,994,0002,514,944