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 03:09anboto1anboto1Score: 6,002Success
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 03:105,938204,971,678184,936,00011,039,0002,117,632
2Jun 8, 2026 03:105,966206,385,446185,847,00011,041,0002,117,632
3Jun 8, 2026 03:105,978206,357,254186,165,00011,140,0002,117,632
4Jun 8, 2026 03:105,981206,480,569186,346,00011,031,0002,117,632
5Jun 8, 2026 03:106,002209,600,835186,949,00011,123,0002,117,632
6Jun 8, 2026 03:106,012207,762,070187,286,00011,138,0002,117,632
7Jun 8, 2026 03:106,039208,348,584188,066,00011,249,0002,117,632
8Jun 8, 2026 03:106,052208,753,578188,496,00011,231,0002,117,632
9Jun 8, 2026 03:106,073210,276,351189,200,00011,238,0002,117,632