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 18:05anboto1anboto1Score: 22,384Success
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 18:0622,148740,632,571724,090,0006,801,0002,113,536
2Jun 7, 2026 18:0622,258743,854,834727,734,0006,810,0002,117,632
3Jun 7, 2026 18:0622,276744,460,104728,428,0006,689,0002,113,536
4Jun 7, 2026 18:0622,295745,491,950728,952,0006,796,0002,113,536
5Jun 7, 2026 18:0622,384748,025,780731,893,0006,796,0002,113,536
6Jun 7, 2026 18:0622,444752,865,529733,876,0006,807,0002,113,536
7Jun 7, 2026 18:0623,240776,620,478759,896,0007,037,0002,113,536
8Jun 7, 2026 18:0623,276777,402,242761,071,0007,053,0002,113,536
9Jun 7, 2026 18:0623,422782,722,593765,879,0007,064,0002,113,536