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 19:19anboto1anboto1Score: 16,463Success
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 19:2016,146542,189,167481,342,00051,498,0002,117,632
2Jun 7, 2026 19:2016,252548,704,865485,324,00051,006,0002,117,632
3Jun 7, 2026 19:2016,281546,602,960485,762,00051,533,0002,117,632
4Jun 7, 2026 19:2016,419551,631,638490,435,00051,417,0002,117,632
5Jun 7, 2026 19:2016,463552,673,972491,623,00051,660,0002,117,632
6Jun 7, 2026 19:2016,541555,237,624494,599,00051,286,0002,117,632
7Jun 7, 2026 19:2016,563556,289,058495,135,00051,450,0002,117,632
8Jun 7, 2026 19:2016,607557,831,175497,003,00051,059,0002,117,632
9Jun 7, 2026 19:2016,663559,106,059497,509,00052,389,0002,117,632