Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listMar 23, 2025 17:37Aniruddha DebAniruddha DebScore: 25,131Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 23, 2025 17:3724,747742,411,112707,651,00010,994,0002,617,344
2Mar 23, 2025 17:3724,920747,611,307714,946,0008,999,0002,580,480
3Mar 23, 2025 17:3724,993749,782,011715,116,00010,001,0002,531,328
4Mar 23, 2025 17:3725,044751,333,778713,504,00011,991,0002,650,112
5Mar 23, 2025 17:3725,131753,929,279721,295,0007,992,0002,744,320
6Mar 23, 2025 17:3725,222756,674,973722,620,00010,994,0002,744,320
7Mar 23, 2025 17:3725,391761,735,530722,571,00010,993,0002,662,400
8Mar 23, 2025 17:3725,568767,034,229725,420,00012,989,0002,711,552
9Mar 23, 2025 17:3726,016780,473,485741,076,00013,982,0002,555,904