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 29, 2026 15:12Charles CabergsCharles CabergsScore: 12,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 15:1311,932357,968,8611,002,225,0009,982,0002,797,568
2Apr 29, 2026 15:1311,985359,569,6691,005,764,0008,997,0002,764,800
3Apr 29, 2026 15:1312,052361,579,7191,016,347,0007,979,0002,904,064
4Apr 29, 2026 15:1312,097362,921,4111,018,610,00010,974,0002,392,064
5Apr 29, 2026 15:1312,113363,398,2211,013,668,0008,970,0002,985,984
6Apr 29, 2026 15:1312,171365,157,2231,027,744,00011,950,0002,867,200
7Apr 29, 2026 15:1312,176365,303,6731,019,672,00012,970,0002,973,696
8Apr 29, 2026 15:1312,194365,824,3211,017,943,0009,970,0002,990,080
9Apr 29, 2026 15:1312,265367,953,8141,030,124,00010,969,0002,719,744