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 14:07anboto1anboto1Score: 5,485Success
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 14:085,459189,413,367171,842,0008,319,0002,117,632
2Jun 8, 2026 14:085,462189,473,988171,919,0008,347,0002,117,632
3Jun 8, 2026 14:085,469189,736,809171,206,0009,299,0002,117,632
4Jun 8, 2026 14:085,481190,188,769171,665,0009,225,0002,117,632
5Jun 8, 2026 14:085,485190,341,782171,792,0009,217,0002,117,632
6Jun 8, 2026 14:085,492190,535,124172,053,0009,206,0002,117,632
7Jun 8, 2026 14:085,539192,069,506173,397,0009,402,0002,117,632
8Jun 8, 2026 14:085,556192,583,863173,988,0009,363,0002,117,632
9Jun 8, 2026 14:085,578193,314,616174,777,0009,326,0002,117,632