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 listMay 10, 2025 15:19KeefeKeefeScore: 12,239Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2025 15:1912,030360,890,211826,276,00035,011,0002,514,944
2May 10, 2025 15:1912,044361,313,689839,477,00036,933,0002,658,304
3May 10, 2025 15:1912,088362,640,064832,009,00030,000,0002,789,376
4May 10, 2025 15:1912,146364,378,917832,707,00028,057,0002,502,656
5May 10, 2025 15:1912,239367,160,003824,356,00032,974,0002,514,944
6May 10, 2025 15:1912,318369,539,352836,811,00036,991,0002,318,336
7May 10, 2025 15:1912,339370,172,514817,404,00037,972,0002,400,256
8May 10, 2025 15:1912,589377,680,576838,271,00035,968,0002,383,872
9May 10, 2025 15:1912,803384,093,203824,417,00035,974,0002,510,848