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 listMar 4, 2026 00:05olliecrowolliecrowScore: 10,862Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 4, 2026 00:0510,744322,310,273852,618,0009,995,0002,658,304
2Mar 4, 2026 00:0510,793323,787,956852,436,0009,993,0002,424,832
3Mar 4, 2026 00:0510,820324,586,684861,284,0008,992,0002,387,968
4Mar 4, 2026 00:0510,835325,036,577853,434,00010,992,0002,527,232
5Mar 4, 2026 00:0510,862325,865,028852,882,00011,984,0002,469,888
6Mar 4, 2026 00:0510,865325,943,427855,313,00010,991,0002,412,544
7Mar 4, 2026 00:0510,924327,712,760856,566,00010,994,0002,609,152
8Mar 4, 2026 00:0510,956328,665,660856,730,00010,983,0002,670,592
9Mar 4, 2026 00:0511,403342,088,139882,752,00010,984,0002,588,672