Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 listJul 21, 2025 17:13Aniruddha DebAniruddha DebScore: 20,328Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 21, 2025 17:1320,097602,915,935541,869,00040,914,0002,609,152
2Jul 21, 2025 17:1320,181605,436,611541,785,00041,983,0002,609,152
3Jul 21, 2025 17:1320,223606,682,372540,530,00041,963,0002,707,456
4Jul 21, 2025 17:1320,270608,108,654537,557,00044,963,0002,613,248
5Jul 21, 2025 17:1320,328609,835,405533,569,00047,961,0002,600,960
6Jul 21, 2025 17:1320,346610,393,395546,222,00041,940,0002,711,552
7Jul 21, 2025 17:1320,359610,768,995539,611,00044,967,0002,609,152
8Jul 21, 2025 17:1320,441613,237,583537,278,00045,938,0002,592,768
9Jul 21, 2025 17:1320,541616,232,848547,043,00043,923,0002,600,960