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 listAug 13, 2026 10:47Yehor BondarYehor BondarScore: 256,244Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 10:49252,4927,574,788,2577,545,874,00018,333,0002,113,536
2Aug 13, 2026 10:49254,2117,626,330,2167,597,786,00018,001,0002,113,536
3Aug 13, 2026 10:49254,4957,634,876,3987,604,856,00018,962,0002,113,536
4Aug 13, 2026 10:49256,0927,682,779,8777,652,764,00019,606,0002,113,536
5Aug 13, 2026 10:49256,2447,687,322,4697,658,335,00018,673,0002,113,536
6Aug 13, 2026 10:49256,2747,688,241,1297,657,357,00019,494,0002,113,536
7Aug 13, 2026 10:49257,1417,714,256,6137,683,734,00020,017,0002,113,536
8Aug 13, 2026 10:49257,7697,733,089,9137,702,720,00019,969,0002,113,536
9Aug 13, 2026 10:49257,9647,738,944,5737,708,121,00020,134,0002,113,536