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 15:15anboto1anboto1Score: 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 15:165,450189,524,775170,614,0009,240,0002,117,632
2Jun 8, 2026 15:165,464189,503,208171,142,0009,174,0002,117,632
3Jun 8, 2026 15:165,467189,661,946171,168,0009,274,0002,117,632
4Jun 8, 2026 15:165,469189,960,521172,219,0008,264,0002,117,632
5Jun 8, 2026 15:165,484190,225,317171,709,0009,278,0002,117,632
6Jun 8, 2026 15:165,489190,408,743171,976,0009,192,0002,117,632
7Jun 8, 2026 15:165,505191,405,943172,430,0009,241,0002,117,632
8Jun 8, 2026 15:165,511191,608,232172,569,0009,300,0002,117,632
9Jun 8, 2026 15:165,541192,734,204173,520,0009,344,0002,117,632