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 listNov 26, 2024 15:34NoSIMD_C#NoSIMD_C#Score: 469,818Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 15:34464,01715,627,267,14715,036,782,000275,794,0002,314,240
2Nov 26, 2024 15:34469,81815,832,921,21715,251,237,000252,755,0002,555,904
3Nov 26, 2024 15:34470,06415,834,946,80215,261,327,000250,775,0002,482,176