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 listApr 1, 2026 14:55olliecrowolliecrowScore: 24,233Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 14:5719,224665,224,876609,425,00024,976,0002,502,656
2Apr 1, 2026 14:5719,896686,497,435633,591,00022,985,0002,400,256
3Apr 1, 2026 14:5719,965684,981,981637,861,00020,995,0002,408,448
4Apr 1, 2026 14:5524,233836,676,200779,736,00019,967,0002,424,832
5Apr 1, 2026 14:5524,429841,181,337786,198,00019,954,0002,375,680
6Apr 1, 2026 14:5524,445837,345,870785,709,00020,965,0002,433,024