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:10anboto1anboto1Score: 5,484Success
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:125,452189,191,070170,740,0009,195,0002,117,632
2Jun 8, 2026 14:125,472190,351,680171,374,0009,226,0002,117,632
3Jun 8, 2026 14:125,473189,907,162171,313,0009,313,0002,117,632
4Jun 8, 2026 14:125,480190,427,307171,658,0009,208,0002,117,632
5Jun 8, 2026 14:125,484190,241,252171,757,0009,242,0002,117,632
6Jun 8, 2026 14:125,488190,779,609171,920,0009,210,0002,117,632
7Jun 8, 2026 14:125,528191,939,983173,118,0009,309,0002,117,632
8Jun 8, 2026 14:125,539191,995,832173,460,0009,330,0002,117,632
9Jun 8, 2026 14:125,539192,055,573173,440,0009,371,0002,117,632