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 02:43anboto1anboto1Score: 6,075Success
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 02:456,058209,632,455184,657,00015,280,0002,117,632
2Jun 8, 2026 02:456,069209,689,718184,915,00015,391,0002,117,632
3Jun 8, 2026 02:456,070210,108,997184,899,00015,413,0002,117,632
4Jun 8, 2026 02:456,071209,627,125185,119,00015,228,0002,117,632
5Jun 8, 2026 02:456,075210,171,467185,241,00015,241,0002,117,632
6Jun 8, 2026 02:456,087210,601,864185,318,00015,560,0002,117,632
7Jun 8, 2026 02:456,091210,555,762185,583,00015,426,0002,117,632
8Jun 8, 2026 02:456,104211,212,434185,923,00015,526,0002,117,632
9Jun 8, 2026 02:456,121211,705,410186,443,00015,579,0002,117,632