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 listNov 26, 2024 15:30NoSIMD_C#NoSIMD_C#Score: 237,768Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 15:30234,8277,044,799,02815,601,599,000294,293,0003,051,520
2Nov 26, 2024 15:30235,8517,075,531,12715,716,867,000285,142,0002,609,152
3Nov 26, 2024 15:30236,2977,088,902,29215,615,897,000314,326,0002,789,376
4Nov 26, 2024 15:30237,6437,129,282,99715,733,575,000293,365,0002,969,600
5Nov 26, 2024 15:30237,7687,133,050,72215,685,803,000325,177,0002,621,440
6Nov 26, 2024 15:30238,2177,146,505,30115,750,911,000277,915,0002,859,008
7Nov 26, 2024 15:30239,0107,170,288,57215,733,778,000303,922,0002,850,816
8Nov 26, 2024 15:30239,1987,175,954,75715,686,492,000319,846,0002,682,880
9Nov 26, 2024 15:30239,3267,179,783,45515,788,291,000305,301,0002,834,432