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:30Kevin HeaveyKevin HeaveyScore: 1,607Success
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:311,53045,921,577107,536,0001,066,000598,016
2Sep 25, 2026 09:311,53446,039,359107,836,0001,038,000598,016
3Sep 25, 2026 09:311,54746,423,917108,116,0001,056,000598,016
4Sep 25, 2026 09:311,60248,060,036107,340,0001,057,000331,776
5Sep 25, 2026 09:311,60748,220,866106,862,0001,065,000331,776
6Sep 25, 2026 09:311,61448,423,181107,467,0001,062,000331,776
7Sep 25, 2026 09:311,63148,953,751107,124,0001,013,000331,776
8Sep 25, 2026 09:311,63449,036,509107,345,0001,062,000331,776
9Sep 25, 2026 09:311,64649,399,424107,758,0001,052,000331,776