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 16, 2026 23:09Tomislav TunkovicTomislav TunkovicScore: 2,172Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 02:432,15564,676,492157,543,0003,116,00069,632
2Aug 17, 2026 02:432,16264,869,676157,316,0003,179,00069,632
3Aug 17, 2026 02:432,16264,874,619157,520,0003,486,00069,632
4Aug 17, 2026 02:432,16464,924,666158,273,0003,111,00069,632
5Aug 17, 2026 02:432,17265,188,470156,914,0003,214,00069,632
6Aug 17, 2026 02:432,17465,246,567156,685,0003,429,00069,632
7Aug 17, 2026 02:432,17465,242,099156,831,0003,089,00069,632
8Aug 17, 2026 02:432,17965,383,817157,340,0003,207,00069,632
9Aug 17, 2026 02:432,18265,476,803158,707,0003,157,00069,632