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 listSep 15, 2026 21:05Josu San MartinJosu San MartinScore: 4,740Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2026 21:064,693140,812,447195,285,0005,316,0002,142,208
2Sep 15, 2026 21:064,704141,148,465196,725,0003,096,0002,142,208
3Sep 15, 2026 21:064,719141,577,404195,067,0005,388,0002,142,208
4Sep 15, 2026 21:064,731141,947,030195,220,0005,424,0002,142,208
5Sep 15, 2026 21:064,740142,227,226195,633,0005,354,0002,142,208
6Sep 15, 2026 21:064,753142,613,851195,227,0005,473,0002,142,208
7Sep 15, 2026 21:064,757142,733,114196,492,0004,408,0002,142,208
8Sep 15, 2026 21:064,823144,710,448199,224,0004,193,0002,142,208
9Sep 15, 2026 21:064,840145,212,500196,896,0005,418,0002,142,208