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 8, 2026 15:13anboto1anboto1Score: 5,534Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 15:145,516191,298,454172,791,0009,268,0002,117,632
2Jun 8, 2026 15:145,519191,365,102173,919,0008,227,0002,117,632
3Jun 8, 2026 15:145,520191,491,343172,990,0009,202,0002,117,632
4Jun 8, 2026 15:145,525191,556,539173,159,0009,186,0002,117,632
5Jun 8, 2026 15:145,534191,860,834173,398,0009,236,0002,117,632
6Jun 8, 2026 15:145,553192,611,853174,053,0009,223,0002,117,632
7Jun 8, 2026 15:145,598193,919,704175,418,0009,348,0002,117,632
8Jun 8, 2026 15:145,607194,253,763175,718,0009,324,0002,117,632
9Jun 8, 2026 15:145,614194,626,227176,072,0009,203,0002,117,632