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 22, 2026 17:36boop34boop34Score: 30,613Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 17:3729,328977,907,940960,804,0007,051,0002,113,536
2Jul 22, 2026 17:3729,730991,151,572973,722,0007,400,0002,117,632
3Jul 22, 2026 17:3729,804994,163,939976,264,0007,276,0002,117,632
4Jul 22, 2026 17:3730,2111,007,263,796989,952,0007,031,0002,113,536
5Jul 22, 2026 17:3730,6131,020,845,5971,004,224,0006,010,0002,117,632
6Jul 22, 2026 17:3731,0601,035,532,5011,017,884,0007,104,0002,117,632
7Jul 22, 2026 17:3731,3801,045,441,0401,028,465,0007,079,0002,117,632
8Jul 22, 2026 17:3732,1061,069,774,8881,052,495,0007,018,0002,117,632
9Jul 22, 2026 17:3732,5761,085,537,4581,067,866,0007,152,0002,117,632