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:00anboto1anboto1Score: 10,708Success
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:0110,645360,645,991339,359,00011,945,0002,117,632
2Jun 8, 2026 01:0110,659361,069,516339,163,00012,590,0002,117,632
3Jun 8, 2026 01:0110,665361,879,892340,032,00011,938,0002,117,632
4Jun 8, 2026 01:0110,666361,211,500339,346,00012,662,0002,117,632
5Jun 8, 2026 01:0110,708362,742,094340,535,00012,838,0002,117,632
6Jun 8, 2026 01:0110,711363,249,731341,322,00012,157,0002,117,632
7Jun 8, 2026 01:0110,761364,547,278342,338,00012,792,0002,117,632
8Jun 8, 2026 01:0110,775364,888,846342,792,00012,786,0002,117,632
9Jun 8, 2026 01:0110,803366,236,415344,403,00012,128,0002,117,632