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 listJul 9, 2026 20:25Victor MerckléVictor MerckléScore: 8,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 20:268,548290,344,301269,265,00012,835,0002,117,632stderr
2Jul 9, 2026 20:268,554290,560,523269,434,00012,877,0002,117,632stderr
3Jul 9, 2026 20:268,556290,571,722269,753,00012,609,0002,117,632stderr
4Jul 9, 2026 20:268,557290,572,858269,348,00013,044,0002,117,632stderr
5Jul 9, 2026 20:268,557292,003,841269,475,00012,925,0002,117,632stderr
6Jul 9, 2026 20:268,586291,367,902270,513,00012,842,0002,121,728stderr
7Jul 9, 2026 20:268,588291,403,427270,377,00013,053,0002,117,632stderr
8Jul 9, 2026 20:268,591291,495,628270,634,00012,890,0002,117,632stderr
9Jul 9, 2026 20:268,683294,697,303273,471,00013,081,0002,117,632stderr