Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 26, 2026 04:10Victor MerckléVictor MerckléScore: 3,033Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 04:112,99589,862,785238,223,0004,108,0002,527,232
2Jun 26, 2026 04:112,99789,923,514240,379,0003,057,0002,527,232
3Jun 26, 2026 04:113,01790,521,960240,151,0004,391,0002,527,232
4Jun 26, 2026 04:113,02290,682,535240,483,0004,417,0002,527,232
5Jun 26, 2026 04:113,03391,015,978241,742,0003,026,0002,531,328
6Jun 26, 2026 04:113,03991,190,180241,111,0004,208,0002,527,232
7Jun 26, 2026 04:113,07292,165,221246,284,0003,026,0002,387,968
8Jun 26, 2026 04:113,08392,511,146246,966,0003,038,0002,531,328
9Jun 26, 2026 04:113,10093,016,370243,626,0004,349,0002,531,328