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 8, 2026 17:11Josu San MartinJosu San MartinScore: 23,807Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2026 17:5323,703815,329,926641,355,000140,858,0002,424,832
2Jan 8, 2026 17:1123,738819,219,585638,483,000144,882,0002,347,008
3Jan 8, 2026 17:5323,805813,193,014643,642,000141,921,0002,269,184
4Jan 8, 2026 17:1123,807811,215,915641,691,000143,930,0002,527,232
5Jan 8, 2026 17:1123,858811,177,909640,438,000146,871,0002,273,280
6Jan 8, 2026 17:5324,114821,398,067648,993,000146,772,0002,281,472