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 7, 2026 20:50anboto1anboto1Score: 13,069Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 20:5112,840433,522,608410,740,00012,989,0002,117,632
2Jun 7, 2026 20:5112,933436,617,766413,670,00013,137,0002,117,632
3Jun 7, 2026 20:5112,999438,342,729416,535,00012,445,0002,117,632
4Jun 7, 2026 20:5113,026439,282,382417,380,00012,493,0002,117,632
5Jun 7, 2026 20:5113,069440,572,699417,797,00013,507,0002,117,632
6Jun 7, 2026 20:5113,070440,582,844418,002,00013,315,0002,117,632
7Jun 7, 2026 20:5113,088441,211,715418,703,00013,220,0002,117,632
8Jun 7, 2026 20:5113,097441,764,018419,744,00012,471,0002,117,632
9Jun 7, 2026 20:5113,110442,416,193420,126,00012,513,0002,117,632