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 listJun 7, 2026 20:12anboto1anboto1Score: 13,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 20:1313,535456,516,042434,064,00012,613,0002,117,632
2Jun 7, 2026 20:1313,553457,082,499434,619,00012,659,0002,117,632
3Jun 7, 2026 20:1313,569457,129,990434,864,00012,915,0002,117,632
4Jun 7, 2026 20:1313,763464,120,895441,164,00013,046,0002,117,632
5Jun 7, 2026 20:1313,797464,710,288442,698,00012,612,0002,117,632
6Jun 7, 2026 20:1313,901468,100,515446,299,00012,460,0002,117,632
7Jun 7, 2026 20:1313,995471,086,360448,406,00013,444,0002,117,632
8Jun 7, 2026 20:1313,998471,657,719448,500,00013,438,0002,117,632
9Jun 7, 2026 20:1314,002471,363,979448,624,00013,455,0002,117,632