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 listJul 2, 2026 03:31Genos0Genos0Score: 203,350Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 03:33202,1996,682,367,8076,616,794,00055,788,0002,113,536
2Jul 2, 2026 03:33202,6776,698,805,8186,637,919,00050,428,0002,113,536
3Jul 2, 2026 03:33203,0446,710,502,8596,651,548,00048,936,0002,113,536
4Jul 2, 2026 03:33203,2826,718,067,5526,658,256,00050,062,0002,113,536
5Jul 2, 2026 03:33203,3506,720,710,3696,661,581,00048,998,0002,113,536
6Jul 2, 2026 03:33203,7896,735,125,0086,671,781,00053,259,0002,113,536
7Jul 2, 2026 03:33204,4086,755,223,3686,696,102,00049,389,0002,113,536
8Jul 2, 2026 03:33204,4436,756,409,3226,698,082,00048,548,0002,113,536
9Jul 2, 2026 03:33210,4846,956,926,5256,885,662,00060,316,0002,113,536