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:52NoSIMD_C#NoSIMD_C#Score: 86,724Success
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:5286,0702,867,609,9282,790,342,00049,970,0002,371,584
2Jan 24, 2025 08:5286,3292,883,616,0472,804,859,00043,982,0002,359,296
3Jan 24, 2025 08:5286,4092,879,604,0442,794,543,00056,970,0002,555,904
4Jan 24, 2025 08:5286,6752,893,703,7372,817,297,00042,974,0002,445,312
5Jan 24, 2025 08:5286,7242,899,092,6822,812,918,00048,963,0002,330,624
6Jan 24, 2025 08:5287,2942,909,442,2542,832,748,00047,961,0002,453,504
7Jan 24, 2025 08:5287,9052,930,579,7202,850,887,00049,962,0002,338,816
8Jan 24, 2025 08:5288,5162,950,260,5792,866,072,00054,963,0002,330,624
9Jan 24, 2025 08:5289,0822,970,144,2602,903,747,00035,972,0002,371,584