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 listSep 25, 2026 09:49Kevin HeaveyKevin HeaveyScore: 1,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 25, 2026 09:501,52345,703,416107,852,0001,029,000589,824
2Sep 25, 2026 09:501,52545,751,523109,280,0000585,728
3Sep 25, 2026 09:501,53546,054,611108,403,0002,022,000585,728
4Sep 25, 2026 09:501,53646,081,570108,126,0002,017,000593,920
5Sep 25, 2026 09:501,59647,894,124107,896,0003,387,000585,728
6Sep 25, 2026 09:501,61148,349,856111,323,0001,036,000593,920
7Sep 25, 2026 09:501,61848,561,732112,673,0000593,920
8Sep 25, 2026 09:501,62448,730,773112,874,0000573,440
9Sep 25, 2026 09:501,62648,785,568112,200,0000593,920