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 10:13Pavel SkripkinPavel SkripkinScore: 60,767Success
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 10:1360,1642,017,945,1501,977,406,0007,997,0002,441,216
2Jan 10, 2026 10:1360,1902,011,630,1901,978,263,0007,997,0002,269,184
3Jan 10, 2026 10:1360,6272,034,768,7731,990,685,0009,993,0002,494,464
4Jan 10, 2026 10:1360,6912,039,774,7451,992,806,0009,994,0002,281,472
5Jan 10, 2026 10:1360,7672,030,499,7641,997,312,0007,997,0002,269,184
6Jan 10, 2026 10:1361,2142,049,641,5642,011,063,0008,995,0002,281,472
7Jan 10, 2026 10:1361,2162,051,326,0052,011,147,0008,996,0002,281,472
8Jan 10, 2026 10:1362,7492,095,791,9302,062,738,0007,995,0002,269,184
9Jan 10, 2026 10:1363,1322,116,925,0432,075,366,0007,993,0002,449,408