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:08anboto1anboto1Score: 22,665Success
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:0922,290744,991,631728,909,0006,689,0002,113,536
2Jun 7, 2026 18:0922,340747,036,080730,547,0006,679,0002,113,536
3Jun 7, 2026 18:0922,454750,749,829734,232,0006,775,0002,113,536
4Jun 7, 2026 18:0922,504752,470,714735,795,0006,851,0002,113,536
5Jun 7, 2026 18:0922,665757,715,851741,100,0006,866,0002,113,536
6Jun 7, 2026 18:0922,751760,543,370744,002,0006,799,0002,113,536
7Jun 7, 2026 18:0923,168773,879,075757,747,0006,813,0002,113,536
8Jun 7, 2026 18:0923,430782,498,737766,256,0006,938,0002,113,536
9Jun 7, 2026 18:0923,433782,983,041767,286,0006,015,0002,113,536