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:55E SequeiraE SequeiraScore: 50,477Success
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:5550,1761,505,279,0363,946,013,00021,977,0002,727,936
2Nov 11, 2024 09:5550,2021,506,055,5233,943,790,00029,990,0002,678,784
3Nov 11, 2024 09:5550,3211,509,615,3723,946,001,00029,969,0002,613,248
4Nov 11, 2024 09:5550,3331,509,982,3623,947,005,00027,971,0002,494,464
5Nov 11, 2024 09:5550,4771,514,310,7983,988,170,00027,952,0002,752,512
6Nov 11, 2024 09:5550,5091,515,258,9603,955,069,00035,964,0002,568,192
7Nov 11, 2024 09:5550,9281,527,826,7514,002,709,00032,939,0002,359,296
8Nov 11, 2024 09:5558,3731,751,193,9634,043,490,00035,092,0002,551,808
9Nov 11, 2024 09:5565,3661,960,989,8034,025,824,00028,664,0002,514,944