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 7, 2026 19:49anboto1anboto1Score: 13,994Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 19:5013,773464,085,050441,476,00013,063,0002,117,632
2Jun 7, 2026 19:5013,888468,229,450445,936,00012,391,0002,117,632
3Jun 7, 2026 19:5013,903468,249,975446,243,00012,568,0002,117,632
4Jun 7, 2026 19:5013,993471,195,171448,807,00012,991,0002,117,632
5Jun 7, 2026 19:5013,994471,201,878449,165,00012,638,0002,117,632
6Jun 7, 2026 19:5014,062473,916,906451,244,00012,804,0002,117,632
7Jun 7, 2026 19:5014,077474,436,700452,253,00012,314,0002,117,632
8Jun 7, 2026 19:5014,109476,377,979452,165,00013,452,0002,117,632
9Jun 7, 2026 19:5014,125475,439,188452,771,00013,356,0002,117,632