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 27, 2026 13:46limanjun99limanjun99Score: 6,939Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 13:476,915246,168,250214,209,00014,013,0002,535,424
2Apr 27, 2026 13:476,929250,646,904213,689,00014,978,0002,523,136
3Apr 27, 2026 13:476,931246,584,049212,745,00015,980,0002,539,520
4Apr 27, 2026 13:476,931247,350,366214,764,00013,984,0002,326,528
5Apr 27, 2026 13:476,939249,971,365214,994,00013,999,0002,523,136
6Apr 27, 2026 13:476,941245,349,234215,072,00014,004,0002,519,040
7Apr 27, 2026 13:476,947249,866,065215,256,00014,016,0002,519,040
8Apr 27, 2026 13:476,965251,019,656213,876,00015,990,0002,347,008
9Apr 27, 2026 13:476,978244,490,814215,275,00015,019,0002,347,008