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 16, 2026 08:30M-RochatM-RochatScore: 57,776Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 08:3155,0001,650,020,5541,627,547,00012,957,0002,113,536
2May 16, 2026 08:3155,1301,653,902,5681,629,921,00012,737,0002,113,536
3May 16, 2026 08:3155,1951,655,867,0441,632,368,00012,781,0002,113,536
4May 16, 2026 08:3157,7641,732,939,8211,710,396,00013,507,0002,113,536
5May 16, 2026 08:3157,7761,733,306,5321,709,578,00013,116,0002,113,536
6May 16, 2026 08:3157,8231,734,712,7381,711,828,00013,299,0002,113,536
7May 16, 2026 08:3157,8241,734,731,7441,711,073,00013,223,0002,113,536
8May 16, 2026 08:3157,8321,734,986,7381,710,580,00013,366,0002,113,536
9May 16, 2026 08:3157,8881,736,656,3291,711,411,00013,473,0002,113,536