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 06:23Charles CabergsCharles CabergsScore: 13,239Success
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 06:2812,910387,309,6431,089,816,00013,984,0002,822,144
2Apr 27, 2026 06:2812,952388,575,8961,092,302,00015,975,0002,813,952
3Apr 27, 2026 06:2812,957388,731,0551,092,873,0009,980,0002,977,792
4Apr 27, 2026 06:2812,970389,108,5271,084,810,00013,984,0002,781,184
5Apr 27, 2026 06:2813,239397,171,5131,116,628,00019,957,0002,965,504
6Apr 27, 2026 06:2813,277398,334,5971,115,867,00019,944,0002,994,176
7Apr 27, 2026 06:2813,285398,557,9221,119,568,00016,963,0002,736,128
8Apr 27, 2026 06:2813,288398,647,5071,118,903,00023,933,0002,977,792
9Apr 27, 2026 06:2813,371401,141,9331,119,587,00013,969,0002,347,008