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 16:00anboto1anboto1Score: 62,390Success
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 16:0161,9422,053,468,6971,999,665,00044,453,0002,113,536
2Jun 7, 2026 16:0161,9742,054,627,2572,001,127,00044,028,0002,113,536
3Jun 7, 2026 16:0162,0512,059,297,7842,003,692,00044,021,0002,113,536
4Jun 7, 2026 16:0162,2022,061,985,6442,008,443,00044,244,0002,113,536
5Jun 7, 2026 16:0162,3902,068,230,0302,012,629,00046,242,0002,113,536
6Jun 7, 2026 16:0162,6822,077,855,4582,023,929,00044,587,0002,113,536
7Jun 7, 2026 16:0162,7312,079,453,3012,023,577,00046,546,0002,113,536
8Jun 7, 2026 16:0162,8172,082,290,7942,027,661,00045,308,0002,113,536
9Jun 7, 2026 16:0162,8652,083,812,5122,029,969,00044,588,0002,113,536