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 listJan 10, 2026 23:33zielajzielajScore: 3,168Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 23:333,089124,946,36999,938,0001,998,0002,535,424
2Jan 10, 2026 23:333,094124,635,429100,102,0002,002,0002,535,424
3Jan 10, 2026 23:333,097126,875,734101,194,0001,001,0002,535,424
4Jan 10, 2026 23:333,146134,248,952102,802,0001,007,0002,273,280
5Jan 10, 2026 23:333,168131,142,240102,535,0002,010,0002,273,280
6Jan 10, 2026 23:333,191129,582,002103,306,0002,005,0002,408,448
7Jan 10, 2026 23:333,219132,668,323105,233,0001,002,0002,535,424
8Jan 10, 2026 23:333,222135,132,700104,326,0002,006,0002,273,280
9Jan 10, 2026 23:333,222131,684,986104,332,0002,006,0002,408,448