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 16:29boop34boop34Score: 13,153Success
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 16:3013,121442,844,848424,355,0008,669,0002,113,536
2Jul 23, 2026 16:3013,125442,958,413424,528,0008,629,0002,113,536
3Jul 23, 2026 16:3013,149443,727,136424,773,0009,171,0002,113,536
4Jul 23, 2026 16:3013,151443,779,865424,883,0009,130,0002,113,536
5Jul 23, 2026 16:3013,153444,121,781425,320,0008,745,0002,113,536
6Jul 23, 2026 16:3013,154443,873,574425,419,0008,686,0002,113,536
7Jul 23, 2026 16:3013,237446,592,658427,616,0009,222,0002,113,536
8Jul 23, 2026 16:3013,281448,002,629429,266,0009,023,0002,113,536
9Jul 23, 2026 16:3013,610467,487,178439,618,0009,512,0002,113,536