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 listMay 1, 2026 11:19Pavel SkripkinPavel SkripkinScore: 16,666Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2026 11:2016,413559,854,036432,717,000108,928,0002,424,832
2May 1, 2026 11:2016,424561,408,075427,994,000113,998,0002,494,464
3May 1, 2026 11:2016,640567,932,037445,098,000104,023,0002,555,904
4May 1, 2026 11:2016,663570,652,089441,903,000107,976,0002,347,008
5May 1, 2026 11:2016,666571,236,411443,999,000105,999,0002,519,040
6May 1, 2026 11:2016,667569,641,520444,031,000106,007,0002,461,696
7May 1, 2026 11:2016,696569,831,765444,986,000105,996,0002,453,504
8May 1, 2026 11:2017,252584,643,023461,464,000107,874,0002,519,040
9May 1, 2026 11:2017,875608,263,337477,920,000111,981,0002,408,448