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 21:21boop34boop34Score: 14,961Success
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 21:2214,830499,327,514466,314,00023,095,0002,113,536
2Jul 22, 2026 21:2214,845499,806,967466,516,00023,369,0002,113,536
3Jul 22, 2026 21:2214,908501,739,637468,822,00023,171,0002,113,536
4Jul 22, 2026 21:2214,956503,460,394470,169,00023,379,0002,113,536
5Jul 22, 2026 21:2214,961503,650,282470,331,00023,384,0002,113,536
6Jul 22, 2026 21:2214,973504,044,123470,722,00023,394,0002,113,536
7Jul 22, 2026 21:2214,992504,504,850472,277,00022,466,0002,113,536
8Jul 22, 2026 21:2215,018505,306,432472,990,00022,604,0002,113,536
9Jul 22, 2026 21:2215,071507,086,627474,571,00022,781,0002,113,536