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 listDec 20, 2025 04:26Rajarshi BasuRajarshi BasuScore: 5,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2025 04:265,741217,868,945184,436,0005,011,0002,322,432
2Dec 20, 2025 04:265,746220,321,451183,617,0005,987,0002,514,944
3Dec 20, 2025 04:265,753219,246,944182,844,0006,994,0002,465,792
4Dec 20, 2025 04:265,763214,990,840185,165,0005,004,0002,510,848
5Dec 20, 2025 04:265,774221,829,324182,567,0007,981,0002,457,600
6Dec 20, 2025 04:265,809214,342,843188,709,0002,995,0002,535,424
7Dec 20, 2025 04:265,929218,972,567189,667,0005,989,0002,469,888
8Dec 20, 2025 04:265,984223,112,109194,473,0003,007,0002,514,944
9Dec 20, 2025 04:266,438238,789,509205,468,0006,981,0002,514,944