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:05highloadLLMhighloadLLMScore: 56,219Success
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:0655,5211,841,795,4141,782,742,00049,465,0002,113,536
2Jun 7, 2026 16:0655,8011,850,623,6561,791,993,00049,443,0002,113,536
3Jun 7, 2026 16:0655,8051,850,672,1071,791,884,00049,693,0002,113,536
4Jun 7, 2026 16:0656,1281,861,379,0191,805,175,00047,079,0002,113,536
5Jun 7, 2026 16:0656,2191,864,525,8891,808,181,00047,078,0002,113,536
6Jun 7, 2026 16:0656,2541,865,620,4411,809,402,00047,004,0002,113,536
7Jun 7, 2026 16:0656,5751,876,124,4461,820,206,00046,792,0002,113,536
8Jun 7, 2026 16:0656,6761,879,630,1761,824,054,00046,285,0002,113,536
9Jun 7, 2026 16:0656,7881,883,267,7031,826,275,00047,741,0002,113,536