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 24, 2026 21:42boop34boop34Score: 7,811Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 21:437,762267,473,191249,042,0007,131,0002,113,536
2Jul 24, 2026 21:437,764267,470,404249,192,0007,044,0002,113,536
3Jul 24, 2026 21:437,810267,468,081250,085,0007,655,0002,113,536
4Jul 24, 2026 21:437,810267,550,404249,495,0008,258,0002,113,536
5Jul 24, 2026 21:437,811267,550,038249,547,0008,224,0002,113,536
6Jul 24, 2026 21:437,817267,707,577249,550,0008,417,0002,113,536
7Jul 24, 2026 21:437,819267,930,862249,932,0008,109,0002,113,536
8Jul 24, 2026 21:437,824268,017,906249,522,0008,675,0002,113,536
9Jul 24, 2026 21:437,834268,318,986249,796,0008,729,0002,113,536