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 listOct 14, 2025 17:00Nguyen Thanh VinhNguyen Thanh VinhScore: 348,086Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2025 17:00343,65411,371,766,03311,240,648,00099,934,0002,420,736
2Oct 14, 2025 17:00348,08611,526,429,38411,392,924,00093,925,0002,473,984
3Oct 14, 2025 17:00351,97211,650,273,18111,531,125,00083,949,0002,273,280