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:07anboto1anboto1Score: 5,857Success
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:085,812201,047,735180,635,00011,174,0002,117,632
2Jun 8, 2026 03:085,814201,709,362180,597,00011,296,0002,117,632
3Jun 8, 2026 03:085,849204,467,782181,605,00011,443,0002,117,632
4Jun 8, 2026 03:085,850202,322,921181,055,00012,009,0002,117,632
5Jun 8, 2026 03:085,857202,508,413181,510,00011,803,0002,117,632
6Jun 8, 2026 03:085,861202,686,305182,110,00011,316,0002,117,632
7Jun 8, 2026 03:085,874203,206,586181,955,00011,907,0002,117,632
8Jun 8, 2026 03:085,888203,484,112182,325,00011,990,0002,117,632
9Jun 8, 2026 03:085,914204,345,437183,146,00012,035,0002,117,632