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 9, 2026 08:57Pavel SkripkinPavel SkripkinScore: 62,277Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 08:5761,8582,077,629,5092,032,324,0008,997,0002,310,144
2Jan 9, 2026 08:5762,0952,079,579,3862,040,134,0008,996,0002,375,680
3Jan 9, 2026 08:5762,0962,082,468,3532,041,168,0007,996,0002,482,176
4Jan 9, 2026 08:5762,1572,077,175,5862,042,182,0008,996,0002,498,560
5Jan 9, 2026 08:5762,2772,080,747,4062,045,130,0009,995,0002,363,392
6Jan 9, 2026 08:5762,4322,095,379,8952,052,256,0007,997,0002,281,472
7Jan 9, 2026 08:5762,4792,090,938,4912,052,821,0008,994,0002,523,136
8Jan 9, 2026 08:5762,6802,093,680,4132,058,445,0009,992,0002,281,472
9Jan 9, 2026 08:5762,9502,107,212,8122,069,367,0007,997,0002,330,624