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 01:24anboto1anboto1Score: 9,815Success
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 01:259,653328,143,306306,592,00011,970,0002,117,632
2Jun 8, 2026 01:259,683329,467,303307,504,00012,035,0002,117,632
3Jun 8, 2026 01:259,723330,736,236308,880,00012,001,0002,117,632
4Jun 8, 2026 01:259,757331,810,064309,943,00012,061,0002,117,632
5Jun 8, 2026 01:259,815333,144,285311,255,00012,657,0002,117,632
6Jun 8, 2026 01:259,839334,019,750312,586,00012,122,0002,117,632
7Jun 8, 2026 01:259,894335,922,808313,669,00012,840,0002,117,632
8Jun 8, 2026 01:259,905336,299,158314,806,00012,086,0002,117,632
9Jun 8, 2026 01:259,981338,601,693316,609,00012,766,0002,117,632