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 20:02Josu San MartinJosu San MartinScore: 6,539Success
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 20:026,421232,975,708205,911,0005,997,0002,375,680
2Jan 9, 2026 20:026,481241,231,814210,860,0002,998,0002,383,872
3Jan 9, 2026 20:026,529247,716,716210,468,0004,987,0002,510,848
4Jan 9, 2026 20:026,539244,532,073210,790,0004,995,0002,371,584
5Jan 9, 2026 20:026,626239,454,700213,663,0004,992,0002,416,640
6Jan 9, 2026 20:026,703243,175,160218,213,0003,002,0002,314,240