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 listAug 17, 2026 12:53Tomislav TunkovicTomislav TunkovicScore: 1,934Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 12:571,91057,304,346128,713,0002,053,00077,824
2Aug 17, 2026 12:571,92557,765,742129,412,0002,061,00081,920
3Aug 17, 2026 12:571,92857,857,866129,555,0002,066,00077,824
4Aug 17, 2026 12:571,92957,878,045129,362,0002,067,00077,824
5Aug 17, 2026 12:571,93458,034,907130,007,0002,089,00077,824
6Aug 17, 2026 12:571,93758,134,982131,045,0002,048,00081,920
7Aug 17, 2026 12:571,94058,200,685130,965,0002,028,00077,824
8Aug 17, 2026 12:571,94158,234,096130,059,0002,073,00077,824
9Aug 17, 2026 12:572,10563,160,330132,892,0002,073,00077,824