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 listJun 8, 2026 10:07anboto1anboto1Score: 5,887Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 10:085,844202,105,669179,376,00013,495,0002,117,632
2Jun 8, 2026 10:085,854202,459,401180,643,00012,567,0002,117,632
3Jun 8, 2026 10:085,875203,103,865180,492,00013,387,0002,117,632
4Jun 8, 2026 10:085,886203,993,403180,669,00013,589,0002,117,632
5Jun 8, 2026 10:085,887203,519,099180,675,00013,621,0002,117,632
6Jun 8, 2026 10:085,889204,025,745181,812,00012,534,0002,117,632
7Jun 8, 2026 10:085,914204,558,513181,516,00013,656,0002,117,632
8Jun 8, 2026 10:085,930204,967,127182,183,00013,537,0002,117,632
9Jun 8, 2026 10:085,948205,978,115182,619,00013,693,0002,117,632