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 01:48olliecrowolliecrowScore: 10,545Success
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 01:4910,489366,546,033311,152,00035,017,0002,514,944
2May 1, 2026 01:4910,514368,771,008298,976,00047,996,0002,514,944
3May 1, 2026 01:4910,519366,896,408294,121,00053,021,0002,330,624
4May 1, 2026 01:4910,536367,970,695299,757,00047,961,0002,510,848
5May 1, 2026 01:4910,545366,010,956298,010,00050,001,0002,506,752
6May 1, 2026 01:4910,561367,734,529301,606,00046,938,0002,519,040
7May 1, 2026 01:4910,569369,236,124309,826,00038,978,0002,514,944
8May 1, 2026 01:4910,656372,078,738299,706,00051,949,0002,527,232
9May 1, 2026 01:4910,714372,200,510308,643,00044,948,0002,523,136