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 2, 2026 04:59Josu San MartinJosu San MartinScore: 22,921Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 05:1322,710773,776,891744,432,0004,996,0002,363,392
2Jan 2, 2026 05:1322,758772,960,242745,010,0006,000,0002,367,488
3Jan 2, 2026 04:5922,830784,934,975745,404,0007,993,0002,347,008
4Jan 2, 2026 05:1322,921779,866,699748,396,0007,993,0002,445,312
5Jan 2, 2026 04:5923,124790,963,856755,085,0008,000,0002,273,280
6Jan 2, 2026 04:5923,838812,659,913777,665,0008,996,0002,355,200