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 listMay 16, 2026 08:36M-RochatM-RochatScore: 30,947Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:4130,589917,680,554901,524,0007,415,0002,113,536
2May 16, 2026 08:4130,759922,779,757906,343,0007,080,0002,113,536
3May 16, 2026 08:4130,877926,316,800910,149,0007,205,0002,113,536
4May 16, 2026 08:4130,920927,616,652908,330,0007,263,0002,113,536
5May 16, 2026 08:4130,947928,419,162910,020,0007,274,0002,113,536
6May 16, 2026 08:4131,047931,425,615915,397,0007,075,0002,113,536
7May 16, 2026 08:4132,560976,826,672957,558,0007,701,0002,113,536
8May 16, 2026 08:4132,602978,063,507959,131,0007,584,0002,113,536
9May 16, 2026 08:4132,618978,560,645959,548,0007,641,0002,113,536