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 09:07anboto1anboto1Score: 5,516Success
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 09:085,497190,622,986172,202,0009,230,0002,117,632
2Jun 8, 2026 09:085,508191,496,766172,512,0009,264,0002,117,632
3Jun 8, 2026 09:085,509191,080,618172,545,0009,256,0002,117,632
4Jun 8, 2026 09:085,513191,266,395172,735,0009,226,0002,117,632
5Jun 8, 2026 09:085,516191,240,097172,830,0009,214,0002,117,632
6Jun 8, 2026 09:085,524191,994,217173,051,0009,251,0002,117,632
7Jun 8, 2026 09:085,563193,325,907174,260,0009,335,0002,117,632
8Jun 8, 2026 09:085,565193,278,100174,348,0009,328,0002,117,632
9Jun 8, 2026 09:085,591193,805,680175,209,0009,298,0002,117,632