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 20, 2026 03:56Victor MerckléVictor MerckléScore: 6,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 20, 2026 03:576,396218,873,359172,767,00038,315,0002,113,536
2Jun 20, 2026 03:576,398218,939,675172,896,00038,241,0002,113,536
3Jun 20, 2026 03:576,401220,546,290173,762,00037,492,0002,113,536
4Jun 20, 2026 03:576,403218,861,264172,724,00038,579,0002,113,536
5Jun 20, 2026 03:576,404219,078,995172,972,00038,366,0002,113,536
6Jun 20, 2026 03:576,427220,077,864173,962,00038,146,0002,113,536
7Jun 20, 2026 03:576,431220,013,455173,837,00038,395,0002,113,536
8Jun 20, 2026 03:576,442220,516,000174,263,00038,328,0002,113,536
9Jun 20, 2026 03:576,505222,485,295177,318,00037,367,0002,113,536