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 listApr 24, 2026 00:34olliecrowolliecrowScore: 14,950Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 24, 2026 00:3514,853508,000,161481,151,0009,002,0002,539,520
2Apr 24, 2026 00:3514,905511,591,431481,877,0009,997,0002,547,712
3Apr 24, 2026 00:3514,914506,064,924482,170,00010,003,0002,539,520
4Apr 24, 2026 00:3514,947511,839,998484,262,0009,004,0002,539,520
5Apr 24, 2026 00:3514,950513,557,006482,381,00010,985,0002,539,520
6Apr 24, 2026 00:3515,063516,405,322488,092,0009,001,0002,535,424
7Apr 24, 2026 00:3515,073515,065,264487,452,0009,988,0002,342,912
8Apr 24, 2026 00:3515,103516,669,590490,400,0008,006,0002,539,520
9Apr 24, 2026 00:3515,165513,451,843490,469,0009,989,0002,342,912