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 13:22anboto1anboto1Score: 5,515Success
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 13:235,484190,158,454171,765,0009,225,0002,117,632
2Jun 8, 2026 13:235,486190,354,860171,826,0009,220,0002,117,632
3Jun 8, 2026 13:235,499190,663,553172,224,0009,251,0002,117,632
4Jun 8, 2026 13:235,509191,033,234172,517,0009,307,0002,117,632
5Jun 8, 2026 13:235,515191,820,229172,727,0009,279,0002,117,632
6Jun 8, 2026 13:235,518191,302,275172,788,0009,311,0002,117,632
7Jun 8, 2026 13:235,521191,854,001172,812,0009,390,0002,117,632
8Jun 8, 2026 13:235,531192,165,125173,199,0009,340,0002,117,632
9Jun 8, 2026 13:235,540192,098,493173,441,0009,411,0002,117,632