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 8, 2026 01:14anboto1anboto1Score: 9,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 01:159,693332,210,639307,867,00012,008,0002,117,632
2Jun 8, 2026 01:159,732330,473,837308,521,00012,644,0002,117,632
3Jun 8, 2026 01:159,763331,920,270310,085,00012,106,0002,117,632
4Jun 8, 2026 01:159,775332,326,224310,593,00011,999,0002,117,632
5Jun 8, 2026 01:159,822333,493,638311,368,00012,770,0002,117,632
6Jun 8, 2026 01:159,823333,419,770311,435,00012,749,0002,117,632
7Jun 8, 2026 01:159,830333,669,852311,740,00012,659,0002,117,632
8Jun 8, 2026 01:1510,052341,016,995319,130,00012,586,0002,117,632
9Jun 8, 2026 01:1510,454356,286,209332,887,00012,109,0002,117,632