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 09:56E SequeiraE SequeiraScore: 50,096Success
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 09:5649,8201,494,592,6583,932,891,00032,973,0002,469,888
2Nov 11, 2024 09:5649,8951,496,844,2583,934,538,00031,971,0002,600,960
3Nov 11, 2024 09:5649,8981,496,934,7773,931,587,00027,975,0002,605,056
4Nov 11, 2024 09:5649,9741,499,206,3303,942,525,00028,981,0002,592,768
5Nov 11, 2024 09:5650,0961,502,876,1823,935,901,00030,991,0002,781,184
6Nov 11, 2024 09:5650,1371,504,105,0023,939,473,00032,987,0002,703,360
7Nov 11, 2024 09:5650,1541,504,606,5253,923,074,00030,976,0002,564,096
8Nov 11, 2024 09:5650,4401,513,210,8753,990,042,00027,951,0002,347,008
9Nov 11, 2024 09:5650,6121,518,345,8683,984,508,00031,947,0002,674,688