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 10, 2026 14:08Pavel SkripkinPavel SkripkinScore: 62,020Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2026 14:0861,3062,053,019,8862,016,097,0006,996,0002,355,200
2Jan 10, 2026 14:1561,3212,051,957,0122,017,613,0005,995,0002,424,832
3Jan 10, 2026 14:1561,9682,080,999,1562,037,961,0006,996,0002,281,472
4Jan 10, 2026 14:0862,0202,079,416,6782,040,660,0005,996,0002,281,472
5Jan 10, 2026 14:1562,1912,083,287,6712,046,317,0005,998,0002,367,488
6Jan 10, 2026 14:0863,4182,119,414,1562,085,784,0006,995,0002,281,472