Unique strings Sergey Svistunov

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 listJan 24, 2025 08:48NoSIMD_C#NoSIMD_C#Score: 93,147Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 24, 2025 08:4892,4573,076,526,1863,000,118,00050,968,0002,543,616
2Feb 6, 2025 08:4992,7283,086,516,6193,014,041,00045,970,0002,502,656
3Feb 6, 2025 08:4992,7603,094,441,2743,012,095,00048,969,0002,523,136
4Jan 24, 2025 08:4893,1473,099,061,0933,023,886,00049,965,0002,441,216
5Feb 6, 2025 08:4993,2163,105,225,1223,023,150,00052,967,0002,387,968
6Jan 24, 2025 08:4893,7293,121,019,5703,050,084,00042,973,0002,527,232