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 listJan 11, 2025 00:57Ian MckibbenIan MckibbenScore: 46,630Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 00:5746,4711,559,202,9731,507,557,00025,992,0002,371,584
2Jan 11, 2025 00:5746,5231,561,303,9321,497,290,00037,981,0002,281,472
3Jan 11, 2025 00:5746,5391,564,601,4651,505,792,00029,995,0002,367,488
4Jan 11, 2025 00:5746,5411,567,677,2421,503,869,00031,975,0002,347,008
5Jan 11, 2025 00:5746,6301,566,026,3631,507,796,00030,995,0002,326,528
6Jan 11, 2025 00:5746,7301,568,830,2361,511,097,00030,981,0002,404,352
7Jan 11, 2025 00:5746,8791,569,841,3081,515,017,00031,979,0002,277,376
8Jan 11, 2025 00:5747,1211,581,348,5261,525,000,00029,980,0002,277,376
9Jan 11, 2025 00:5747,5671,598,013,9731,535,713,00033,993,0002,506,752