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:44Kevin HeaveyKevin HeaveyScore: 1,601Success
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:451,53446,041,919108,052,0002,026,000585,728
2Sep 25, 2026 09:451,53746,134,998107,624,0002,035,000585,728
3Sep 25, 2026 09:451,53946,185,076108,980,0001,016,000585,728
4Sep 25, 2026 09:451,57547,258,917108,872,0000581,632
5Sep 25, 2026 09:451,60148,054,338110,462,0001,013,000573,440
6Sep 25, 2026 09:451,62148,639,896111,059,0001,022,000593,920
7Sep 25, 2026 09:451,83254,967,141108,889,0000585,728
8Sep 25, 2026 09:451,87056,110,360110,885,0000593,920
9Sep 25, 2026 09:451,92057,611,135111,347,0001,017,000593,920