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 listNov 15, 2025 00:09izotoffizotoffScore: 91,326Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2025 00:0989,3882,985,430,9102,931,804,00017,992,0002,342,912
2Nov 15, 2025 00:0990,0522,998,434,2722,959,718,00011,994,0002,367,488
3Nov 15, 2025 00:0990,5323,016,856,0572,974,579,00012,993,0002,543,616
4Nov 15, 2025 00:0991,0443,038,977,0102,986,440,00017,996,0002,469,888
5Nov 15, 2025 00:0991,3263,042,300,0522,992,788,00020,984,0002,363,392
6Nov 15, 2025 00:0992,2593,074,593,2383,027,563,00016,991,0002,506,752
7Nov 15, 2025 00:0992,7003,096,801,1423,049,094,0009,993,0002,355,200
8Nov 15, 2025 00:0992,7773,089,193,8503,046,643,00014,993,0002,420,736
9Nov 15, 2025 00:0993,0213,106,858,6073,049,703,00019,984,0002,523,136