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:27M-RochatM-RochatScore: 68,435Success
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:2967,2852,018,563,7891,967,976,00040,468,0002,117,632
2May 16, 2026 08:2967,2932,018,799,6751,966,252,00040,840,0002,117,632
3May 16, 2026 08:2967,3192,019,593,0061,966,349,00041,616,0002,117,632
4May 16, 2026 08:2967,5892,027,683,4781,974,482,00041,401,0002,117,632
5May 16, 2026 08:2968,4352,053,073,3031,998,793,00043,744,0002,117,632
6May 16, 2026 08:2969,0052,070,151,9312,018,639,00041,353,0002,117,632
7May 16, 2026 08:2969,0132,070,413,0612,019,693,00040,634,0002,117,632
8May 16, 2026 08:2969,1432,074,316,4212,020,477,00042,126,0002,117,632
9May 16, 2026 08:2969,1772,075,318,4482,021,974,00041,408,0002,117,632