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 01:08anboto1anboto1Score: 9,838Success
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 01:099,753331,230,859309,223,00012,647,0002,117,632
2Jun 8, 2026 01:099,784332,617,765311,003,00011,893,0002,117,632
3Jun 8, 2026 01:099,796332,982,344311,235,00012,039,0002,117,632
4Jun 8, 2026 01:099,811333,115,574311,183,00012,593,0002,117,632
5Jun 8, 2026 01:099,838334,483,237312,559,00012,110,0002,117,632
6Jun 8, 2026 01:099,868335,355,259313,520,00012,130,0002,117,632
7Jun 8, 2026 01:099,925336,735,269314,829,00012,699,0002,117,632
8Jun 8, 2026 01:099,950337,545,166315,508,00012,856,0002,117,632
9Jun 8, 2026 01:099,991338,979,367317,688,00012,015,0002,117,632