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 30, 2025 08:47KeefeKeefeScore: 83,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 30, 2025 08:4780,8452,695,790,7092,654,901,00012,994,0002,281,472
2Jan 30, 2025 08:4780,9372,701,322,7682,658,926,00011,995,0002,461,696
3Jan 30, 2025 08:4781,2492,711,089,1332,668,218,00012,991,0002,486,272
4Jan 30, 2025 08:4782,2202,741,860,5832,699,277,00013,991,0002,277,376
5Jan 30, 2025 08:4783,5962,793,166,9322,743,666,00014,992,0002,420,736
6Jan 30, 2025 08:4784,5422,827,187,5392,777,907,00011,995,0002,281,472
7Jan 30, 2025 08:4785,3612,852,807,6502,804,926,00011,995,0002,281,472
8Jan 30, 2025 08:4785,7142,852,194,8872,814,562,00013,992,0002,523,136
9Jan 30, 2025 08:4785,8312,861,711,5592,820,445,00011,993,0002,265,088