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 listNov 11, 2024 10:23E SequeiraE SequeiraScore: 37,445Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 11, 2024 10:2337,1971,115,898,0032,737,562,00071,988,0002,551,808
2Nov 11, 2024 10:2337,3391,120,158,3022,737,318,00075,925,0002,568,192
3Nov 11, 2024 10:2337,3401,120,213,7292,745,011,00066,975,0002,666,496
4Nov 11, 2024 10:2337,3811,121,430,3232,752,032,00061,955,0002,359,296
5Nov 11, 2024 10:2337,4451,123,342,3942,744,188,00065,932,0002,588,672
6Nov 11, 2024 10:2337,4671,124,020,4962,741,856,00065,972,0002,789,376
7Nov 11, 2024 10:2337,5061,125,194,5642,744,137,00067,953,0002,707,456
8Nov 11, 2024 10:2337,5381,126,151,4132,744,900,00068,947,0002,551,808
9Nov 11, 2024 10:2337,6571,129,710,8982,756,814,00068,970,0002,785,280