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 02:00anboto1anboto1Score: 9,828Success
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 02:019,691329,007,241307,753,00012,061,0002,117,632
2Jun 8, 2026 02:019,788332,315,643310,335,00012,686,0002,117,632
3Jun 8, 2026 02:019,796333,930,041310,512,00012,777,0002,117,632
4Jun 8, 2026 02:019,826333,678,671311,689,00012,578,0002,117,632
5Jun 8, 2026 02:019,828333,548,747311,682,00012,651,0002,117,632
6Jun 8, 2026 02:019,853334,404,935312,516,00012,643,0002,117,632
7Jun 8, 2026 02:019,883335,356,680313,563,00012,592,0002,117,632
8Jun 8, 2026 02:019,954337,860,726315,497,00013,016,0002,117,632
9Jun 8, 2026 02:019,969338,280,823316,229,00012,758,0002,117,632