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 listJan 12, 2026 02:55Josu San MartinJosu San MartinScore: 4,566Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 02:554,565181,043,000147,656,0002,993,0002,387,968
2Jan 12, 2026 02:554,566178,652,142149,670,000997,0002,289,664
3Jan 12, 2026 02:554,566175,221,464148,688,0001,995,0002,285,568
4Jan 12, 2026 02:554,566174,652,986147,682,0002,993,0002,289,664
5Jan 12, 2026 02:554,566178,421,248147,694,0002,993,0002,408,448
6Jan 12, 2026 02:554,567178,306,651148,709,0001,996,0002,510,848