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 listApr 27, 2026 21:41TudyMTudyMScore: 18,893Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 21:4117,894536,848,1881,412,504,00036,960,0002,764,800
2Apr 27, 2026 21:4118,172545,188,6111,446,418,00031,965,0002,932,736
3Apr 27, 2026 21:4118,374551,223,7651,459,089,00029,981,0002,732,032
4Apr 27, 2026 21:4118,458553,753,4611,454,688,00035,967,0002,977,792
5Apr 27, 2026 21:4118,893566,818,1621,492,574,00033,967,0002,965,504
6Apr 27, 2026 21:4119,052571,589,8241,514,189,00029,983,0002,932,736
7Apr 27, 2026 21:4120,399611,988,5441,653,165,00029,930,0003,002,368
8Apr 27, 2026 21:4120,497614,922,1041,651,059,00034,916,0002,985,984
9Apr 27, 2026 21:4120,501615,042,8561,643,305,00035,919,0002,932,736