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 listJul 23, 2026 17:35boop34boop34Score: 10,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 17:3610,393352,772,096338,104,0004,881,0002,113,536
2Jul 23, 2026 17:3610,453354,799,933339,894,0005,082,0002,113,536
3Jul 23, 2026 17:3610,482355,749,857340,765,0005,169,0002,113,536
4Jul 23, 2026 17:3610,489355,911,398341,047,0005,119,0002,113,536
5Jul 23, 2026 17:3610,518356,922,880341,759,0005,348,0002,113,536
6Jul 23, 2026 17:3610,535357,425,198342,714,0004,973,0002,113,536
7Jul 23, 2026 17:3610,542357,861,148342,869,0005,042,0002,113,536
8Jul 23, 2026 17:3610,546357,827,567342,870,0005,175,0002,113,536
9Jul 23, 2026 17:3610,554358,118,092343,128,0005,178,0002,113,536