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 15, 2026 22:30Adam FolwarcznyAdam FolwarcznyScore: 12,764Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 15, 2026 22:3012,640439,937,026399,116,00018,005,0002,293,760
2Jan 15, 2026 22:3012,677445,801,707401,329,00017,013,0002,367,488
3Jan 15, 2026 22:3012,685440,869,905403,631,00014,986,0002,371,584
4Jan 15, 2026 22:3012,700442,070,617406,111,00013,003,0002,379,776
5Jan 15, 2026 22:3012,764444,538,453406,201,00015,007,0002,306,048
6Jan 15, 2026 22:3012,802447,335,692402,498,00019,975,0002,400,256
7Jan 15, 2026 22:3012,829452,459,610405,373,00017,972,0002,375,680
8Jan 15, 2026 22:3013,037454,714,521414,242,00015,970,0002,371,584
9Jan 15, 2026 22:3013,064453,042,564418,130,00012,973,0002,371,584