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 15, 2026 06:51Tomislav TunkovicTomislav TunkovicScore: 2,919Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 06:522,81684,488,709212,788,00011,211,0002,162,688
2Aug 15, 2026 06:522,84985,486,167213,851,00011,245,0002,162,688
3Aug 15, 2026 06:522,89086,708,205211,599,00011,701,0002,154,496
4Aug 15, 2026 06:522,90387,096,635214,688,00011,474,0002,158,592
5Aug 15, 2026 06:522,91987,572,481217,088,00011,924,0002,162,688
6Aug 15, 2026 06:522,94988,497,063220,521,00010,741,0002,162,688
7Aug 15, 2026 06:522,95188,535,486220,459,00010,761,0002,162,688
8Aug 15, 2026 06:522,99089,714,316224,241,00010,756,0002,162,688
9Aug 15, 2026 06:522,99389,815,856219,102,00011,007,0002,154,496