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:39anboto1anboto1Score: 6,285Success
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:406,208214,245,113190,687,00014,204,0002,117,632
2Jun 8, 2026 02:406,261215,861,807191,567,00015,056,0002,117,632
3Jun 8, 2026 02:406,264216,396,244192,509,00014,230,0002,117,632
4Jun 8, 2026 02:406,277216,915,373192,794,00014,349,0002,117,632
5Jun 8, 2026 02:406,285216,655,018192,069,00015,336,0002,117,632
6Jun 8, 2026 02:406,290216,804,930192,456,00015,134,0002,117,632
7Jun 8, 2026 02:406,300217,190,132192,726,00015,174,0002,117,632
8Jun 8, 2026 02:406,306218,742,176192,791,00015,321,0002,117,632
9Jun 8, 2026 02:406,324218,443,975194,158,00014,535,0002,117,632