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 listNov 5, 2026 17:21e1011e1011Score: 29,457Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 17:2329,359979,918,434936,495,00032,379,0002,113,536
2Nov 5, 2026 17:2329,361979,902,706936,642,00032,279,0002,113,536
3Nov 5, 2026 17:2329,388980,732,256938,187,00031,618,0002,113,536
4Nov 5, 2026 17:2329,397981,602,490937,705,00032,424,0002,113,536
5Nov 5, 2026 17:2329,457983,496,504940,244,00031,851,0002,113,536
6Nov 5, 2026 17:2329,472983,586,484940,958,00031,625,0002,113,536
7Nov 5, 2026 17:2329,504984,543,791941,225,00032,408,0002,113,536
8Nov 5, 2026 17:2329,511984,696,764941,073,00032,803,0002,113,536
9Nov 5, 2026 17:2329,539985,623,509942,075,00032,716,0002,113,536