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 listApr 29, 2026 15:41TudyMTudyMScore: 10,830Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 15:4210,579317,385,735860,932,00013,998,0002,666,496
2Apr 29, 2026 15:4210,580317,409,400858,560,00021,013,0002,818,048
3Apr 29, 2026 15:4210,714321,447,703863,039,00016,019,0002,691,072
4Apr 29, 2026 15:4210,748322,451,460868,446,00013,006,0002,678,784
5Apr 29, 2026 15:4210,830324,904,231864,262,00018,005,0002,359,296
6Apr 29, 2026 15:4211,151334,552,476920,410,00013,991,0002,592,768
7Apr 29, 2026 15:4211,265337,967,794912,486,00017,989,0002,453,504
8Apr 29, 2026 15:4211,296338,901,312920,001,00013,000,0002,785,280
9Apr 29, 2026 15:4211,430342,919,620919,533,00016,972,0002,379,776